./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:10:36,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:10:36,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:10:36,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:10:36,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:10:36,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:10:36,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:10:36,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:10:36,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:10:36,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:10:36,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:10:36,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:10:36,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:10:36,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:10:36,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:10:36,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:10:36,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:10:36,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:10:36,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:10:36,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:10:36,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:10:36,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:10:36,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:10:36,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:10:36,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:10:36,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:10:36,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:10:36,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:10:36,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:10:36,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:10:36,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:10:36,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:10:36,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:10:36,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:10:36,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:10:36,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:10:36,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:10:36,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:10:36,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:10:36,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:10:36,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:10:36,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:10:36,932 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 [2024-11-12 06:10:37,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:10:37,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:10:37,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:10:37,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:10:37,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:10:37,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-12 06:10:38,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:10:39,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:10:39,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-12 06:10:39,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7755e82/a06c6414eb0849a7a76c27708dc0e57a/FLAGed79f5f48 [2024-11-12 06:10:39,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7755e82/a06c6414eb0849a7a76c27708dc0e57a [2024-11-12 06:10:39,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:10:39,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:10:39,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:10:39,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:10:39,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:10:39,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1c77d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39, skipping insertion in model container [2024-11-12 06:10:39,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:10:39,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-12 06:10:39,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:10:39,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:10:39,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-12 06:10:39,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:10:39,521 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:10:39,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39 WrapperNode [2024-11-12 06:10:39,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:10:39,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:10:39,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:10:39,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:10:39,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,596 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-12 06:10:39,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:10:39,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:10:39,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:10:39,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:10:39,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:10:39,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:10:39,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:10:39,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:10:39,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:10:39,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (1/1) ... [2024-11-12 06:10:39,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:10:39,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:10:39,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:10:39,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:10:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:10:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:10:39,874 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:10:39,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:10:40,330 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 06:10:40,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:10:40,351 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:10:40,353 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:10:40,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:10:40 BoogieIcfgContainer [2024-11-12 06:10:40,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:10:40,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:10:40,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:10:40,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:10:40,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:10:39" (1/3) ... [2024-11-12 06:10:40,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a287e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:10:40, skipping insertion in model container [2024-11-12 06:10:40,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:10:39" (2/3) ... [2024-11-12 06:10:40,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a287e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:10:40, skipping insertion in model container [2024-11-12 06:10:40,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:10:40" (3/3) ... [2024-11-12 06:10:40,367 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-97.i [2024-11-12 06:10:40,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:10:40,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:10:40,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:10:40,456 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@619ea4a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:10:40,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:10:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:10:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:10:40,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:40,477 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:10:40,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -526305821, now seen corresponding path program 1 times [2024-11-12 06:10:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:40,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523259412] [2024-11-12 06:10:40,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:10:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:10:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:10:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:10:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:10:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:10:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:10:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:10:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:10:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:10:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:10:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:10:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:10:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:10:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:10:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:10:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:10:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 06:10:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 06:10:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 06:10:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 06:10:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:10:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 06:10:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 06:10:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 06:10:41,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523259412] [2024-11-12 06:10:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523259412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:10:41,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:10:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:10:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799934674] [2024-11-12 06:10:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:10:41,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:10:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:10:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:10:41,188 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 06:10:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:41,233 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-12 06:10:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:10:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-12 06:10:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:41,247 INFO L225 Difference]: With dead ends: 155 [2024-11-12 06:10:41,248 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 06:10:41,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:10:41,259 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:41,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:10:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 06:10:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 06:10:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:10:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-12 06:10:41,312 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-11-12 06:10:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:41,313 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-12 06:10:41,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 06:10:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-12 06:10:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:10:41,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:41,319 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:10:41,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:10:41,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:41,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -179999509, now seen corresponding path program 1 times [2024-11-12 06:10:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410229398] [2024-11-12 06:10:41,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:10:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:10:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:10:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:10:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:10:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:10:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:10:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:10:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:10:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:10:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:10:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:10:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:10:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:10:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:10:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:10:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:10:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 06:10:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 06:10:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 06:10:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 06:10:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:10:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 06:10:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 06:10:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 06:10:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:41,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410229398] [2024-11-12 06:10:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410229398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:10:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:10:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:10:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078975026] [2024-11-12 06:10:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:10:41,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:10:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:10:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:10:41,742 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 06:10:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:41,840 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2024-11-12 06:10:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:10:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-12 06:10:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:41,844 INFO L225 Difference]: With dead ends: 216 [2024-11-12 06:10:41,844 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 06:10:41,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:10:41,848 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 96 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:41,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 300 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:10:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 06:10:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2024-11-12 06:10:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:10:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-12 06:10:41,874 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 159 [2024-11-12 06:10:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:41,879 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-12 06:10:41,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 06:10:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-12 06:10:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:10:41,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:41,885 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:10:41,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:10:41,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 69351161, now seen corresponding path program 1 times [2024-11-12 06:10:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:41,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423226295] [2024-11-12 06:10:41,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:10:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996389295] [2024-11-12 06:10:42,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:10:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:10:42,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:10:42,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:10:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:42,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 06:10:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:10:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 515 proven. 150 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-12 06:10:44,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:10:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423226295] [2024-11-12 06:10:45,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 06:10:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996389295] [2024-11-12 06:10:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996389295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:10:45,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:10:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-12 06:10:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155457586] [2024-11-12 06:10:45,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 06:10:45,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 06:10:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 06:10:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-11-12 06:10:45,806 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 06:10:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:47,511 INFO L93 Difference]: Finished difference Result 354 states and 504 transitions. [2024-11-12 06:10:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-12 06:10:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) Word has length 159 [2024-11-12 06:10:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:47,516 INFO L225 Difference]: With dead ends: 354 [2024-11-12 06:10:47,518 INFO L226 Difference]: Without dead ends: 270 [2024-11-12 06:10:47,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1125, Invalid=3297, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 06:10:47,524 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 543 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:47,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 457 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 06:10:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-12 06:10:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 119. [2024-11-12 06:10:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:10:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-11-12 06:10:47,563 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 159 [2024-11-12 06:10:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:47,563 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-11-12 06:10:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 06:10:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-11-12 06:10:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:10:47,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:47,570 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:10:47,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:10:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:10:47,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1795679469, now seen corresponding path program 1 times [2024-11-12 06:10:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417859207] [2024-11-12 06:10:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:10:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:10:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:10:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:10:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:10:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:10:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:10:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:10:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:10:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:10:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:10:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:10:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:10:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:10:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:10:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:10:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:10:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 06:10:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 06:10:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 06:10:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 06:10:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:10:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 06:10:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 06:10:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 06:10:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417859207] [2024-11-12 06:10:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417859207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:10:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570284407] [2024-11-12 06:10:48,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:48,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:10:48,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:10:48,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:10:48,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 06:10:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:48,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 06:10:48,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:10:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 06:10:48,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:10:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 06:10:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570284407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:10:49,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:10:49,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2024-11-12 06:10:49,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976067614] [2024-11-12 06:10:49,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:10:49,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:10:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:49,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:10:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:10:49,161 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 06:10:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:49,665 INFO L93 Difference]: Finished difference Result 312 states and 421 transitions. [2024-11-12 06:10:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:10:49,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 160 [2024-11-12 06:10:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:49,668 INFO L225 Difference]: With dead ends: 312 [2024-11-12 06:10:49,668 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 06:10:49,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-12 06:10:49,670 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 191 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:49,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 417 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:10:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 06:10:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 107. [2024-11-12 06:10:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:10:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2024-11-12 06:10:49,701 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 160 [2024-11-12 06:10:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:49,702 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2024-11-12 06:10:49,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 06:10:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2024-11-12 06:10:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:10:49,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:49,707 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:10:49,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:10:49,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 06:10:49,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1546328799, now seen corresponding path program 1 times [2024-11-12 06:10:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980017881] [2024-11-12 06:10:49,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:10:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419055830] [2024-11-12 06:10:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:10:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:10:50,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:10:50,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 06:10:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:51,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 06:10:51,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:10:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 728 proven. 111 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-12 06:10:51,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:10:56,100 WARN L851 $PredicateComparison]: unable to prove that (and (= (mod c_~var_1_23~0 256) 0) (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256))))) is different from false [2024-11-12 06:11:00,269 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_23~0 256) 0)) is different from false [2024-11-12 06:11:04,771 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_24~0 256) 0)) is different from false [2024-11-12 06:11:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:11:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980017881] [2024-11-12 06:11:05,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 06:11:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419055830] [2024-11-12 06:11:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419055830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:11:05,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:11:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-12 06:11:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715355802] [2024-11-12 06:11:05,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 06:11:05,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 06:11:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:11:05,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 06:11:05,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=166, Unknown=3, NotChecked=84, Total=306 [2024-11-12 06:11:05,096 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 06:11:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:11:09,001 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2024-11-12 06:11:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 06:11:09,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2024-11-12 06:11:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:11:09,004 INFO L225 Difference]: With dead ends: 260 [2024-11-12 06:11:09,004 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 06:11:09,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=223, Invalid=598, Unknown=3, NotChecked=168, Total=992 [2024-11-12 06:11:09,006 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 233 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:11:09,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 342 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 06:11:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 06:11:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2024-11-12 06:11:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:11:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2024-11-12 06:11:09,030 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 160 [2024-11-12 06:11:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:11:09,031 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2024-11-12 06:11:09,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 06:11:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2024-11-12 06:11:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:11:09,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:11:09,035 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:11:09,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 06:11:09,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:11:09,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:11:09,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:11:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash 288909640, now seen corresponding path program 1 times [2024-11-12 06:11:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:11:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775729132] [2024-11-12 06:11:09,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:11:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:11:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:11:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425404704] [2024-11-12 06:11:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:11:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:11:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:11:09,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:11:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 06:11:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:11:09,856 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:11:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:11:10,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:11:10,046 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:11:10,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:11:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 06:11:10,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:11:10,253 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 06:11:10,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:11:10,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:11:10 BoogieIcfgContainer [2024-11-12 06:11:10,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:11:10,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:11:10,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:11:10,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:11:10,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:10:40" (3/4) ... [2024-11-12 06:11:10,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:11:10,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:11:10,389 INFO L158 Benchmark]: Toolchain (without parser) took 31331.19ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 138.3MB in the beginning and 82.1MB in the end (delta: 56.2MB). Peak memory consumption was 158.1MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,389 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:11:10,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.47ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 119.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.36ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 115.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,390 INFO L158 Benchmark]: Boogie Preprocessor took 93.85ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 107.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,390 INFO L158 Benchmark]: RCFGBuilder took 661.58ms. Allocated memory is still 169.9MB. Free memory was 107.0MB in the beginning and 80.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,391 INFO L158 Benchmark]: TraceAbstraction took 30028.17ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 79.7MB in the beginning and 83.2MB in the end (delta: -3.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2024-11-12 06:11:10,391 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 272.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:11:10,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.47ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 119.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.36ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 115.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.85ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 107.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 661.58ms. Allocated memory is still 169.9MB. Free memory was 107.0MB in the beginning and 80.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30028.17ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 79.7MB in the beginning and 83.2MB in the end (delta: -3.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 272.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_7 = 2819353023; [L25] signed short int var_1_9 = 25; [L26] signed short int var_1_10 = 25; [L27] signed short int var_1_11 = 0; [L28] float var_1_12 = 255.8; [L29] unsigned char var_1_14 = 200; [L30] unsigned char var_1_15 = 5; [L31] unsigned char var_1_16 = 4; [L32] float var_1_17 = 99999.5; [L33] float var_1_18 = 63.4; [L34] double var_1_19 = 63.5; [L35] double var_1_20 = 9.95; [L36] double var_1_21 = 5.7; [L37] double var_1_22 = 3.85; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int var_1_25 = 0; [L41] unsigned long int var_1_26 = 16; [L42] unsigned long int var_1_27 = 1840944138; [L43] unsigned short int var_1_28 = 0; [L44] float var_1_29 = 1.1; [L45] signed char var_1_30 = 25; [L46] unsigned char last_1_var_1_23 = 1; [L47] float last_1_var_1_29 = 1.1; VAL [isInitial=0, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L184] last_1_var_1_23 = var_1_23 [L185] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_2 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L145] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L147] var_1_7 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L148] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L149] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L149] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L150] var_1_10 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L151] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L152] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L152] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L153] var_1_11 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L154] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L155] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L155] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L156] var_1_14 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_14 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L157] RET assume_abort_if_not(var_1_14 >= 191) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L158] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L158] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L159] var_1_15 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L161] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L161] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L164] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L164] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L166] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L168] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L170] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L171] var_1_21 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L172] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L176] var_1_26 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L177] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L178] CALL assume_abort_if_not(var_1_26 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L178] RET assume_abort_if_not(var_1_26 <= 536870912) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L179] var_1_27 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_27 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L180] RET assume_abort_if_not(var_1_27 >= 1073741823) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L181] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L181] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L196] RET updateVariables() [L197] CALL step() [L51] COND TRUE var_1_21 < (256.8 - var_1_20) [L52] var_1_22 = ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L56] COND FALSE !(((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) [L59] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L61] unsigned long int stepLocal_5 = var_1_26; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_5=536870912, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L62] COND FALSE !(stepLocal_5 < var_1_11) [L69] var_1_28 = var_1_11 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L71] COND TRUE last_1_var_1_29 > 1.9 [L72] var_1_29 = var_1_20 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L76] unsigned char stepLocal_6 = var_1_14; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_6=191, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L77] COND TRUE var_1_28 >= stepLocal_6 [L78] var_1_30 = ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=25] [L84] COND FALSE !((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=25] [L87] COND FALSE !(var_1_23 || var_1_23) [L90] var_1_9 = -8 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L93] COND FALSE !(var_1_22 < var_1_17) [L96] var_1_25 = ((var_1_27 - var_1_16) + var_1_15) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L98] signed long int stepLocal_4 = (((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)); [L99] signed long int stepLocal_3 = 64; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_3=64, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L100] COND TRUE var_1_16 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L101] COND TRUE var_1_22 != var_1_17 [L102] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L111] COND FALSE !(var_1_23 || (var_1_19 < var_1_19)) [L118] var_1_12 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L120] unsigned short int stepLocal_2 = var_1_28; [L121] unsigned char stepLocal_1 = var_1_23; [L122] unsigned long int stepLocal_0 = var_1_7 - var_1_28; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=10737385473, stepLocal_1=0, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L123] COND FALSE !(stepLocal_1 && var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=10737385473, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L128] COND FALSE !(stepLocal_0 <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) [L139] var_1_1 = var_1_28 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((((((var_1_23 && var_1_23) ? ((var_1_12 == var_1_22) ? (var_1_1 == ((unsigned long int) (var_1_28 + 10u))) : 1) : (((var_1_7 - var_1_28) <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) ? ((var_1_22 != var_1_12) ? ((var_1_7 < var_1_28) ? (var_1_1 == ((unsigned long int) var_1_28)) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28)))) && (((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) ? (var_1_9 == ((signed short int) (var_1_10 - var_1_11))) : ((var_1_23 || var_1_23) ? (var_1_9 == ((signed short int) var_1_11)) : (var_1_9 == ((signed short int) -8))))) && ((var_1_23 || (var_1_19 < var_1_19)) ? ((((var_1_14 - var_1_15) - var_1_16) > var_1_10) ? (var_1_12 == ((float) (var_1_17 + var_1_18))) : (var_1_12 == ((float) var_1_18))) : (var_1_12 == ((float) var_1_17)))) && ((var_1_16 >= 64) ? ((var_1_22 != var_1_17) ? (var_1_19 == ((double) var_1_17)) : 1) : ((var_1_25 > ((((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)))) ? (var_1_19 == ((double) (((((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) < (var_1_17)) ? ((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) : (var_1_17))))) : (var_1_19 == ((double) 9.2))))) && ((var_1_21 < (256.8 - var_1_20)) ? (var_1_22 == ((double) ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))))) : (var_1_22 == ((double) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))))) && ((((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) ? (var_1_23 == ((unsigned char) (last_1_var_1_23 && (var_1_2 && var_1_24)))) : (var_1_23 == ((unsigned char) var_1_24)))) && ((var_1_22 < var_1_17) ? (var_1_25 == ((unsigned long int) (var_1_16 + ((var_1_14 + var_1_28) + var_1_11)))) : (var_1_25 == ((unsigned long int) ((var_1_27 - var_1_16) + var_1_15))))) && ((var_1_26 < var_1_11) ? (var_1_24 ? (var_1_28 == ((unsigned short int) ((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) > (var_1_14)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_14))))) : (var_1_28 == ((unsigned short int) ((((var_1_14) < (var_1_11)) ? (var_1_14) : (var_1_11)))))) : (var_1_28 == ((unsigned short int) var_1_11)))) && ((last_1_var_1_29 > 1.9) ? (var_1_29 == ((float) var_1_20)) : (var_1_29 == ((float) ((((var_1_21 - var_1_20) < 0 ) ? -(var_1_21 - var_1_20) : (var_1_21 - var_1_20))))))) && ((var_1_28 >= var_1_14) ? (var_1_30 == ((signed char) ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))))) : ((! var_1_23) ? (var_1_30 == ((signed char) ((((-1) < 0 ) ? -(-1) : (-1))))) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1108 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1063 mSDsluCounter, 1636 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1057 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1742 IncrementalHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 579 mSDtfsCounter, 1742 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 920 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 346 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4605 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1123 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 7431/7728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:11:10,610 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-12 06:11:10,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:11:12,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:11:12,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:11:12,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:11:12,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:11:12,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:11:12,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:11:12,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:11:12,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:11:12,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:11:12,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:11:12,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:11:12,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:11:12,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:11:12,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:11:12,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:11:12,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:11:12,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:11:12,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:11:12,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:11:12,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:11:12,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:11:12,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:11:12,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:11:12,960 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:11:12,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:11:12,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:11:12,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:11:12,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:11:12,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:11:12,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:11:12,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:11:12,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:11:12,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:11:12,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:11:12,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:11:12,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:11:12,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:11:12,969 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:11:12,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:11:12,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:11:12,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:11:12,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:11:12,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:11:12,971 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 [2024-11-12 06:11:13,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:11:13,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:11:13,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:11:13,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:11:13,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:11:13,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-12 06:11:14,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:11:15,197 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:11:15,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-12 06:11:15,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b36d46ab/79f02aa02d314124a84be45cb598cbd9/FLAGc361a9ca1 [2024-11-12 06:11:15,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b36d46ab/79f02aa02d314124a84be45cb598cbd9 [2024-11-12 06:11:15,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:11:15,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:11:15,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:11:15,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:11:15,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:11:15,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762fc696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15, skipping insertion in model container [2024-11-12 06:11:15,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:11:15,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-12 06:11:15,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:11:15,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:11:15,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-12 06:11:15,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:11:15,711 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:11:15,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15 WrapperNode [2024-11-12 06:11:15,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:11:15,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:11:15,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:11:15,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:11:15,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,783 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 06:11:15,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:11:15,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:11:15,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:11:15,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:11:15,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,834 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:11:15,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:11:15,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:11:15,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:11:15,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:11:15,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (1/1) ... [2024-11-12 06:11:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:11:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:11:15,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:11:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:11:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:11:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:11:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:11:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:11:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:11:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:11:16,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:11:16,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:11:24,025 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 06:11:24,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:11:24,044 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:11:24,047 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:11:24,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:11:24 BoogieIcfgContainer [2024-11-12 06:11:24,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:11:24,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:11:24,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:11:24,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:11:24,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:11:15" (1/3) ... [2024-11-12 06:11:24,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485b9147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:11:24, skipping insertion in model container [2024-11-12 06:11:24,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:11:15" (2/3) ... [2024-11-12 06:11:24,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485b9147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:11:24, skipping insertion in model container [2024-11-12 06:11:24,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:11:24" (3/3) ... [2024-11-12 06:11:24,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-97.i [2024-11-12 06:11:24,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:11:24,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:11:24,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:11:24,145 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f093fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:11:24,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:11:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:11:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:11:24,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:11:24,172 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:11:24,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:11:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:11:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash -526305821, now seen corresponding path program 1 times [2024-11-12 06:11:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:11:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156128047] [2024-11-12 06:11:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:11:24,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:11:24,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:11:24,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:11:24,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:11:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:11:24,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:11:24,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:11:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 06:11:24,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:11:24,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:11:24,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156128047] [2024-11-12 06:11:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156128047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:11:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:11:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:11:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121311834] [2024-11-12 06:11:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:11:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:11:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:11:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:11:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:11:24,977 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 06:11:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:11:25,010 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-12 06:11:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:11:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-12 06:11:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:11:25,022 INFO L225 Difference]: With dead ends: 155 [2024-11-12 06:11:25,022 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 06:11:25,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:11:25,029 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:11:25,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:11:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 06:11:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 06:11:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:11:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-12 06:11:25,073 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-11-12 06:11:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:11:25,073 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-12 06:11:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 06:11:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-12 06:11:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:11:25,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:11:25,078 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:11:25,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:11:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:11:25,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:11:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:11:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -179999509, now seen corresponding path program 1 times [2024-11-12 06:11:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:11:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071670450] [2024-11-12 06:11:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:11:25,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:11:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:11:25,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:11:25,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:11:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:11:25,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:11:25,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:11:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 06:11:31,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:11:31,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:11:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071670450] [2024-11-12 06:11:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071670450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:11:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:11:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:11:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287096493] [2024-11-12 06:11:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:11:31,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:11:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:11:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:11:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:11:31,164 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 06:11:38,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:11:42,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:11:45,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:11:50,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:11:54,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:11:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:11:54,984 INFO L93 Difference]: Finished difference Result 226 states and 355 transitions. [2024-11-12 06:11:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:11:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-12 06:11:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:11:54,993 INFO L225 Difference]: With dead ends: 226 [2024-11-12 06:11:54,993 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 06:11:54,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:11:54,995 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 75 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:11:54,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 287 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 23.7s Time] [2024-11-12 06:11:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 06:11:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2024-11-12 06:11:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 06:11:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2024-11-12 06:11:55,038 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 159 [2024-11-12 06:11:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:11:55,039 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2024-11-12 06:11:55,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 06:11:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-11-12 06:11:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:11:55,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:11:55,045 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:11:55,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:11:55,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:11:55,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:11:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:11:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1201067863, now seen corresponding path program 1 times [2024-11-12 06:11:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:11:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029810814] [2024-11-12 06:11:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:11:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:11:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:11:55,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:11:55,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:11:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:11:55,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:11:55,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:11:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 06:11:57,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:11:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 06:11:58,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:11:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029810814] [2024-11-12 06:11:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029810814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:11:58,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:11:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-12 06:11:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805863319] [2024-11-12 06:11:58,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:11:58,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 06:11:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:11:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 06:11:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:11:58,900 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)