./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.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 d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:18:20,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:18:20,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:18:20,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:18:20,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:18:20,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:18:20,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:18:20,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:18:20,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:18:20,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:18:20,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:18:20,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:18:20,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:18:20,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:18:20,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:18:20,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:18:20,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:18:20,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:18:20,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:18:20,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:18:20,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:18:20,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:18:20,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:18:20,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:18:20,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:18:20,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:18:20,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:18:20,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:18:20,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:18:20,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:18:20,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:18:20,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:18:20,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:18:20,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:18:20,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:18:20,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:18:20,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:18:20,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:18:20,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:18:20,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:18:20,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:18:20,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:18:20,619 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 -> d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144 [2024-10-24 09:18:20,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:18:20,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:18:20,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:18:20,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:18:20,927 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:18:20,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:22,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:18:22,647 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:18:22,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:22,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dca1c987/2ada7970a7314a4bb99d6ce81ef8607d/FLAGbe8925fcd [2024-10-24 09:18:22,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dca1c987/2ada7970a7314a4bb99d6ce81ef8607d [2024-10-24 09:18:22,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:18:22,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:18:22,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:18:22,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:18:22,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:18:22,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:18:22" (1/1) ... [2024-10-24 09:18:22,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696ef246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:22, skipping insertion in model container [2024-10-24 09:18:22,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:18:22" (1/1) ... [2024-10-24 09:18:22,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:18:22,905 WARN L248 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_loopvsstraightlinecode_100-while_file-6.i[915,928] [2024-10-24 09:18:22,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:18:22,987 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:18:22,997 WARN L248 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_loopvsstraightlinecode_100-while_file-6.i[915,928] [2024-10-24 09:18:23,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:18:23,075 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:18:23,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23 WrapperNode [2024-10-24 09:18:23,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:18:23,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:18:23,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:18:23,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:18:23,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,143 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-24 09:18:23,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:18:23,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:18:23,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:18:23,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:18:23,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,193 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-10-24 09:18:23,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:18:23,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:18:23,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:18:23,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:18:23,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (1/1) ... [2024-10-24 09:18:23,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:18:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:18:23,283 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-10-24 09:18:23,286 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-10-24 09:18:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:18:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:18:23,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:18:23,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:18:23,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:18:23,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:18:23,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:18:23,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:18:23,930 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-24 09:18:23,931 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:18:23,966 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:18:23,966 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:18:23,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:18:23 BoogieIcfgContainer [2024-10-24 09:18:23,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:18:23,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:18:23,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:18:23,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:18:23,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:18:22" (1/3) ... [2024-10-24 09:18:23,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b95aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:18:23, skipping insertion in model container [2024-10-24 09:18:23,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:23" (2/3) ... [2024-10-24 09:18:23,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b95aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:18:23, skipping insertion in model container [2024-10-24 09:18:23,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:18:23" (3/3) ... [2024-10-24 09:18:23,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:23,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:18:23,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:18:24,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:18:24,078 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;@42ddaea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:18:24,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:18:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 60 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:18:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 09:18:24,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:24,102 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:24,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:24,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1463726607, now seen corresponding path program 1 times [2024-10-24 09:18:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11650868] [2024-10-24 09:18:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:18:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:18:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:18:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:18:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:18:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:18:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:18:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:18:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:18:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:18:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:18:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:18:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:18:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:18:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:18:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:18:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:18:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:18:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:18:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:18:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:18:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 09:18:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:18:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:18:24,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:18:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11650868] [2024-10-24 09:18:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11650868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:18:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:18:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:18:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359666407] [2024-10-24 09:18:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:18:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:18:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:18:24,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:18:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:18:24,710 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 60 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:18:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:24,746 INFO L93 Difference]: Finished difference Result 166 states and 289 transitions. [2024-10-24 09:18:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:18:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2024-10-24 09:18:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:24,760 INFO L225 Difference]: With dead ends: 166 [2024-10-24 09:18:24,761 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 09:18:24,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-10-24 09:18:24,768 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:24,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:18:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 09:18:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 09:18:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:18:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-24 09:18:24,817 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 149 [2024-10-24 09:18:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:24,817 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-24 09:18:24,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:18:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-24 09:18:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 09:18:24,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:24,821 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:24,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:18:24,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 525698935, now seen corresponding path program 1 times [2024-10-24 09:18:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693335759] [2024-10-24 09:18:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:18:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:18:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:18:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:18:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:18:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:18:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:18:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:18:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:18:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:18:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:18:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:18:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:18:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:18:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:18:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:18:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:18:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:18:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:18:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:18:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:18:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 09:18:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:18:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:18:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:18:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693335759] [2024-10-24 09:18:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693335759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:18:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:18:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:18:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882026882] [2024-10-24 09:18:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:18:25,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:18:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:18:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:18:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:18:25,259 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:18:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:25,390 INFO L93 Difference]: Finished difference Result 243 states and 368 transitions. [2024-10-24 09:18:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:18:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 149 [2024-10-24 09:18:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:25,394 INFO L225 Difference]: With dead ends: 243 [2024-10-24 09:18:25,395 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 09:18:25,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:18:25,400 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 146 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:25,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:18:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 09:18:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2024-10-24 09:18:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 110 states have internal predecessors, (159), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:18:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2024-10-24 09:18:25,430 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 149 [2024-10-24 09:18:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:25,431 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2024-10-24 09:18:25,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:18:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2024-10-24 09:18:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 09:18:25,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:25,437 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:25,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:18:25,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:25,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -754164743, now seen corresponding path program 1 times [2024-10-24 09:18:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:25,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438199935] [2024-10-24 09:18:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:18:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:18:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:18:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:18:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:18:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:18:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:18:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:18:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:18:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:18:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:18:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:18:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:18:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:18:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:18:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:18:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:18:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:18:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:18:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:18:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:18:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 09:18:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:18:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 09:18:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:18:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438199935] [2024-10-24 09:18:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438199935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:18:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217170257] [2024-10-24 09:18:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:26,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:18:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:18:26,642 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-10-24 09:18:26,645 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-10-24 09:18:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:27,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 09:18:27,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:18:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-24 09:18:27,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:18:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-24 09:18:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217170257] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:18:28,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:18:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2024-10-24 09:18:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471462676] [2024-10-24 09:18:28,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:18:28,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 09:18:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:18:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 09:18:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2024-10-24 09:18:28,253 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 26 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-24 09:18:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:30,755 INFO L93 Difference]: Finished difference Result 526 states and 758 transitions. [2024-10-24 09:18:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-24 09:18:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) Word has length 149 [2024-10-24 09:18:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:30,763 INFO L225 Difference]: With dead ends: 526 [2024-10-24 09:18:30,765 INFO L226 Difference]: Without dead ends: 390 [2024-10-24 09:18:30,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=3125, Unknown=0, NotChecked=0, Total=4160 [2024-10-24 09:18:30,770 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 664 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:30,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1657 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 09:18:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-24 09:18:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 224. [2024-10-24 09:18:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 167 states have (on average 1.3652694610778444) internal successors, (228), 169 states have internal predecessors, (228), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 09:18:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 324 transitions. [2024-10-24 09:18:30,829 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 324 transitions. Word has length 149 [2024-10-24 09:18:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:30,830 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 324 transitions. [2024-10-24 09:18:30,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-24 09:18:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 324 transitions. [2024-10-24 09:18:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:18:30,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:30,833 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:30,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:18:31,034 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-10-24 09:18:31,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash -532823760, now seen corresponding path program 1 times [2024-10-24 09:18:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674199042] [2024-10-24 09:18:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:18:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:18:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:18:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:18:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:18:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:18:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:18:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:18:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:18:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:18:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:18:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:18:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:18:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:18:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:18:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:18:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:18:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:18:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:18:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:18:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:18:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 09:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:18:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 09:18:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:18:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674199042] [2024-10-24 09:18:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674199042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:18:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374872236] [2024-10-24 09:18:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:18:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:18:31,429 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-10-24 09:18:31,430 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-10-24 09:18:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:31,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:18:31,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:18:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-24 09:18:31,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:18:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 09:18:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374872236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:18:31,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:18:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-10-24 09:18:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462917] [2024-10-24 09:18:31,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:18:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:18:31,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:18:31,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:18:31,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:18:31,973 INFO L87 Difference]: Start difference. First operand 224 states and 324 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 09:18:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:32,154 INFO L93 Difference]: Finished difference Result 436 states and 620 transitions. [2024-10-24 09:18:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:18:32,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 150 [2024-10-24 09:18:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:32,160 INFO L225 Difference]: With dead ends: 436 [2024-10-24 09:18:32,160 INFO L226 Difference]: Without dead ends: 213 [2024-10-24 09:18:32,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:18:32,163 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 164 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:32,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 225 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:18:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-24 09:18:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2024-10-24 09:18:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 148 states have internal predecessors, (192), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 09:18:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 288 transitions. [2024-10-24 09:18:32,203 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 288 transitions. Word has length 150 [2024-10-24 09:18:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:32,204 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 288 transitions. [2024-10-24 09:18:32,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 09:18:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 288 transitions. [2024-10-24 09:18:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:18:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:32,206 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:32,225 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-10-24 09:18:32,407 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-10-24 09:18:32,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:32,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2129457576, now seen corresponding path program 1 times [2024-10-24 09:18:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976652748] [2024-10-24 09:18:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:18:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:18:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:18:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:18:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:18:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:18:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:18:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:18:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:18:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:18:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:18:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:18:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:18:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:18:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:18:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:18:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:18:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:18:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:18:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:18:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:18:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 09:18:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:18:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:18:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:18:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976652748] [2024-10-24 09:18:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976652748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:18:32,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:18:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:18:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450795389] [2024-10-24 09:18:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:18:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:18:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:18:32,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:18:32,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:18:32,524 INFO L87 Difference]: Start difference. First operand 205 states and 288 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:18:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:32,569 INFO L93 Difference]: Finished difference Result 423 states and 604 transitions. [2024-10-24 09:18:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:18:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:18:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:32,574 INFO L225 Difference]: With dead ends: 423 [2024-10-24 09:18:32,574 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 09:18:32,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-10-24 09:18:32,576 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 38 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:32,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 240 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:18:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 09:18:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2024-10-24 09:18:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 188 states have (on average 1.3351063829787233) internal successors, (251), 190 states have internal predecessors, (251), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 09:18:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2024-10-24 09:18:32,606 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 150 [2024-10-24 09:18:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:32,608 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2024-10-24 09:18:32,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:18:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2024-10-24 09:18:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 09:18:32,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:32,611 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:18:32,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -243292390, now seen corresponding path program 1 times [2024-10-24 09:18:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:18:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735484054] [2024-10-24 09:18:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:18:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:18:32,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:18:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:18:32,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:18:32,799 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:18:32,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:18:32,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:18:32,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:18:32,918 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:18:32,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:18:32 BoogieIcfgContainer [2024-10-24 09:18:32,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:18:32,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:18:32,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:18:32,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:18:32,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:18:23" (3/4) ... [2024-10-24 09:18:32,925 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:18:32,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:18:32,926 INFO L158 Benchmark]: Toolchain (without parser) took 10252.04ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 141.8MB in the beginning and 52.8MB in the end (delta: 89.1MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,927 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:18:32,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.46ms. Allocated memory is still 174.1MB. Free memory was 141.8MB in the beginning and 123.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.31ms. Allocated memory is still 174.1MB. Free memory was 123.2MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,928 INFO L158 Benchmark]: Boogie Preprocessor took 101.26ms. Allocated memory is still 174.1MB. Free memory was 118.0MB in the beginning and 109.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,929 INFO L158 Benchmark]: RCFGBuilder took 720.57ms. Allocated memory is still 174.1MB. Free memory was 109.6MB in the beginning and 77.1MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,929 INFO L158 Benchmark]: TraceAbstraction took 8950.71ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 77.1MB in the beginning and 53.8MB in the end (delta: 23.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-10-24 09:18:32,929 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 209.7MB. Free memory was 53.8MB in the beginning and 52.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:18:32,931 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.17ms. Allocated memory is still 121.6MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.46ms. Allocated memory is still 174.1MB. Free memory was 141.8MB in the beginning and 123.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.31ms. Allocated memory is still 174.1MB. Free memory was 123.2MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.26ms. Allocated memory is still 174.1MB. Free memory was 118.0MB in the beginning and 109.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 720.57ms. Allocated memory is still 174.1MB. Free memory was 109.6MB in the beginning and 77.1MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8950.71ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 77.1MB in the beginning and 53.8MB in the end (delta: 23.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 209.7MB. Free memory was 53.8MB in the beginning and 52.8MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 34011; [L26] unsigned short int var_1_6 = 2; [L27] signed short int var_1_7 = -4; [L28] signed long int var_1_9 = -4; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_12 = 1.8; [L31] double var_1_13 = 49.5; [L32] double var_1_14 = 0.0; [L33] double var_1_15 = 8.5; [L34] unsigned long int var_1_16 = 4; [L35] float var_1_17 = 3.65; [L36] unsigned char var_1_18 = 0; [L37] signed long int var_1_19 = 32; [L38] signed long int var_1_20 = 1000000000; [L39] signed long int var_1_21 = 1141305717; [L40] unsigned char var_1_22 = 50; [L41] unsigned char var_1_23 = 0; [L42] unsigned short int var_1_24 = 2; [L43] signed short int var_1_25 = -16; [L44] double var_1_26 = 15.6; [L45] double var_1_27 = 4.25; [L46] unsigned long int var_1_28 = 10; [L47] unsigned char last_1_var_1_22 = 50; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_22 = var_1_22 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L142] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L147] var_1_6 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L148] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L149] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L149] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L150] var_1_13 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L152] var_1_14 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L159] var_1_20 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_20 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L160] RET assume_abort_if_not(var_1_20 >= 536870911) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L162] var_1_21 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_21 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L163] RET assume_abort_if_not(var_1_21 >= 1073741822) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L165] var_1_23 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L166] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L171] var_1_27 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L187] RET updateVariables() [L188] CALL step() [L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22) [L52] unsigned char stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3)) [L54] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L58] COND TRUE var_1_2 || var_1_3 [L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L63] COND FALSE !(var_1_22 <= (- 500)) [L68] var_1_7 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L70] var_1_10 = (var_1_5 - (var_1_22 + 1000)) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L71] COND FALSE !(! var_1_3) [L74] var_1_12 = (var_1_14 - var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L76] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L77] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0 [L81] var_1_16 = 128u VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L86] COND TRUE \read(var_1_18) [L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L99] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L100] COND TRUE ! ((! var_1_3) && var_1_18) [L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L107] unsigned short int stepLocal_4 = var_1_24; [L108] unsigned short int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L122] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=254, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L123] COND TRUE var_1_24 >= stepLocal_1 VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L124] COND TRUE ! var_1_2 [L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5))) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1031 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1012 mSDsluCounter, 2569 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1825 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 744 mSDtfsCounter, 2051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=5, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 227 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1197 NumberOfCodeBlocks, 1197 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1336 ConstructedInterpolants, 0 QuantifiedInterpolants, 3337 SizeOfPredicates, 12 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8850/9108 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-10-24 09:18:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.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 d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:18:35,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:18:35,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:18:35,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:18:35,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:18:35,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:18:35,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:18:35,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:18:35,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:18:35,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:18:35,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:18:35,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:18:35,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:18:35,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:18:35,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:18:35,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:18:35,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:18:35,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:18:35,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:18:35,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:18:35,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:18:35,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:18:35,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:18:35,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:18:35,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:18:35,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:18:35,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:18:35,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:18:35,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:18:35,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:18:35,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:18:35,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:18:35,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:18:35,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:18:35,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:18:35,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:18:35,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:18:35,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:18:35,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:18:35,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:18:35,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:18:35,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:18:35,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:18:35,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:18:35,362 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:18:35,362 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 -> d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144 [2024-10-24 09:18:35,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:18:35,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:18:35,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:18:35,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:18:35,726 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:18:35,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:37,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:18:37,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:18:37,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:37,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102ebd541/a3fc32d387334f36bb5fb74d9c0619fc/FLAGff66d0c92 [2024-10-24 09:18:37,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102ebd541/a3fc32d387334f36bb5fb74d9c0619fc [2024-10-24 09:18:37,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:18:37,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:18:37,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:18:37,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:18:37,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:18:37,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:37,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d291fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37, skipping insertion in model container [2024-10-24 09:18:37,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:37,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:18:37,784 WARN L248 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_loopvsstraightlinecode_100-while_file-6.i[915,928] [2024-10-24 09:18:37,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:18:37,894 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:18:37,907 WARN L248 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_loopvsstraightlinecode_100-while_file-6.i[915,928] [2024-10-24 09:18:37,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:18:37,981 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:18:37,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37 WrapperNode [2024-10-24 09:18:37,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:18:37,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:18:37,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:18:37,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:18:37,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,048 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-24 09:18:38,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:18:38,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:18:38,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:18:38,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:18:38,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,090 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-10-24 09:18:38,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:18:38,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:18:38,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:18:38,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:18:38,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (1/1) ... [2024-10-24 09:18:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:18:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:18:38,177 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-10-24 09:18:38,180 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-10-24 09:18:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:18:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:18:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:18:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:18:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:18:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:18:38,319 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:18:38,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:18:53,361 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 09:18:53,361 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:18:53,436 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:18:53,436 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:18:53,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:18:53 BoogieIcfgContainer [2024-10-24 09:18:53,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:18:53,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:18:53,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:18:53,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:18:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:18:37" (1/3) ... [2024-10-24 09:18:53,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d9063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:18:53, skipping insertion in model container [2024-10-24 09:18:53,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:18:37" (2/3) ... [2024-10-24 09:18:53,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d9063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:18:53, skipping insertion in model container [2024-10-24 09:18:53,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:18:53" (3/3) ... [2024-10-24 09:18:53,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-6.i [2024-10-24 09:18:53,467 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:18:53,468 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:18:53,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:18:53,547 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;@59b3842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:18:53,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:18:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:18:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:18:53,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:53,568 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:53,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -665579295, now seen corresponding path program 1 times [2024-10-24 09:18:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:18:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567710938] [2024-10-24 09:18:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:53,585 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-10-24 09:18:53,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:18:53,587 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-10-24 09:18:53,604 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-10-24 09:18:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:54,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:18:54,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:18:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-24 09:18:54,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:18:54,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:18:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567710938] [2024-10-24 09:18:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567710938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:18:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:18:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:18:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621901708] [2024-10-24 09:18:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:18:54,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:18:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:18:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:18:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:18:54,822 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:18:59,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:18:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:18:59,239 INFO L93 Difference]: Finished difference Result 144 states and 257 transitions. [2024-10-24 09:18:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:18:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-24 09:18:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:18:59,365 INFO L225 Difference]: With dead ends: 144 [2024-10-24 09:18:59,366 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 09:18:59,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-10-24 09:18:59,371 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:18:59,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 09:18:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 09:18:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 09:18:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:18:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-24 09:18:59,410 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 147 [2024-10-24 09:18:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:18:59,411 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-24 09:18:59,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:18:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-24 09:18:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:18:59,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:18:59,415 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:18:59,445 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-10-24 09:18:59,615 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-10-24 09:18:59,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 462746599, now seen corresponding path program 1 times [2024-10-24 09:18:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:18:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719636975] [2024-10-24 09:18:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:59,618 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-10-24 09:18:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:18:59,621 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-10-24 09:18:59,622 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-10-24 09:19:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:19:00,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 09:19:00,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:19:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:19:01,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:19:01,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:19:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719636975] [2024-10-24 09:19:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719636975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:19:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:19:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:19:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312571837] [2024-10-24 09:19:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:19:01,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:19:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:19:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:19:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:19:01,222 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:19:04,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:19:06,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:19:12,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:19:16,485 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-10-24 09:19:20,488 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-10-24 09:19:24,493 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-10-24 09:19:28,498 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-10-24 09:19:32,507 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-10-24 09:19:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:19:32,775 INFO L93 Difference]: Finished difference Result 199 states and 304 transitions. [2024-10-24 09:19:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:19:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-10-24 09:19:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:19:32,778 INFO L225 Difference]: With dead ends: 199 [2024-10-24 09:19:32,778 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 09:19:32,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:19:32,780 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 72 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:19:32,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 334 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 31.5s Time] [2024-10-24 09:19:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 09:19:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2024-10-24 09:19:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:19:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2024-10-24 09:19:32,802 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 147 [2024-10-24 09:19:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:19:32,804 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2024-10-24 09:19:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:19:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2024-10-24 09:19:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:19:32,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:19:32,807 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:19:32,841 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 (3)] Ended with exit code 0 [2024-10-24 09:19:33,007 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-10-24 09:19:33,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:19:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:19:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -124059415, now seen corresponding path program 1 times [2024-10-24 09:19:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:19:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59417927] [2024-10-24 09:19:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:19:33,010 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-10-24 09:19:33,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:19:33,013 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-10-24 09:19:33,015 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-10-24 09:19:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:19:34,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 09:19:34,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:19:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-24 09:19:37,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:19:39,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:19:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59417927] [2024-10-24 09:19:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59417927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:19:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [978902606] [2024-10-24 09:19:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:19:39,634 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:19:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:19:39,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:19:39,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 09:19:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:19:43,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 09:19:43,306 INFO L278 TraceCheckSpWp]: Computing forward predicates...