./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_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 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:01:14,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:01:14,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:01:14,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:01:14,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:01:14,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:01:14,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:01:14,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:01:14,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:01:14,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:01:14,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:01:14,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:01:14,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:01:14,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:01:14,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:01:14,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:01:14,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:01:14,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:01:14,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:01:14,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:01:14,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:01:14,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:01:14,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:01:14,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:01:14,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:01:14,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:01:14,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:01:14,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:01:14,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:01:14,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:01:14,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:01:14,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:01:14,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:14,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:01:14,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:01:14,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:01:14,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:01:14,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:01:14,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:01:14,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:01:14,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:01:14,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:01:14,582 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 -> 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a [2024-11-12 05:01:14,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:01:14,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:01:14,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:01:14,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:01:14,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:01:14,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:16,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:01:16,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:01:16,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:16,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9badc6070/c8b557c8cefb44318bc4c0a4b08a406d/FLAG886d0e4a9 [2024-11-12 05:01:16,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9badc6070/c8b557c8cefb44318bc4c0a4b08a406d [2024-11-12 05:01:16,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:01:16,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:01:16,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:16,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:01:16,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:01:16,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:16,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504c7f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16, skipping insertion in model container [2024-11-12 05:01:16,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:16,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:01:16,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-11-12 05:01:16,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:16,904 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:01:16,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-11-12 05:01:16,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:16,977 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:01:16,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16 WrapperNode [2024-11-12 05:01:16,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:16,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:16,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:01:16,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:01:16,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:16,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,076 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-12 05:01:17,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:17,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:01:17,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:01:17,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:01:17,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,118 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:01:17,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:01:17,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:01:17,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:01:17,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:01:17,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (1/1) ... [2024-11-12 05:01:17,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:17,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:01:17,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:01:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:01:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:01:17,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:01:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:01:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:01:17,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:01:17,319 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:01:17,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:01:17,690 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-12 05:01:17,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:01:17,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:01:17,700 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:01:17,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:17 BoogieIcfgContainer [2024-11-12 05:01:17,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:01:17,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:01:17,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:01:17,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:01:17,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:01:16" (1/3) ... [2024-11-12 05:01:17,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d662c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:17, skipping insertion in model container [2024-11-12 05:01:17,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:16" (2/3) ... [2024-11-12 05:01:17,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d662c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:17, skipping insertion in model container [2024-11-12 05:01:17,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:17" (3/3) ... [2024-11-12 05:01:17,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:17,720 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:01:17,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:01:17,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:01:17,774 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;@70a177d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:01:17,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:01:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 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-11-12 05:01:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 05:01:17,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:17,791 INFO L218 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, 1, 1] [2024-11-12 05:01:17,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -276520337, now seen corresponding path program 1 times [2024-11-12 05:01:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375688862] [2024-11-12 05:01:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:01:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:01:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:01:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:01:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:01:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:01:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 05:01:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:01:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:01:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:01:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:01:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:01:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:01:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 05:01:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375688862] [2024-11-12 05:01:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375688862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:01:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378638763] [2024-11-12 05:01:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:18,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:01:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:01:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:18,192 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-11-12 05:01:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:18,215 INFO L93 Difference]: Finished difference Result 180 states and 302 transitions. [2024-11-12 05:01:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:01:18,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 153 [2024-11-12 05:01:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:18,225 INFO L225 Difference]: With dead ends: 180 [2024-11-12 05:01:18,225 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 05:01:18,228 INFO L434 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-11-12 05:01:18,230 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:18,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 05:01:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 05:01:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 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-11-12 05:01:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-12 05:01:18,268 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 153 [2024-11-12 05:01:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-12 05:01:18,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-11-12 05:01:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-12 05:01:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 05:01:18,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:18,272 INFO L218 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, 1, 1] [2024-11-12 05:01:18,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:01:18,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1266129321, now seen corresponding path program 1 times [2024-11-12 05:01:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481855381] [2024-11-12 05:01:18,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:01:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:01:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:01:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:01:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:01:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:01:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 05:01:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:01:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:01:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:01:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:01:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:01:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:01:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-12 05:01:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481855381] [2024-11-12 05:01:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481855381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:01:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062832292] [2024-11-12 05:01:19,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:19,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:01:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:01:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:20,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 05:01:20,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:01:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 510 proven. 42 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-12 05:01:20,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:01:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 138 proven. 51 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-11-12 05:01:21,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062832292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:01:21,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:01:21,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2024-11-12 05:01:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6162399] [2024-11-12 05:01:21,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:01:21,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 05:01:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 05:01:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 05:01:21,327 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 36 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 10 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) [2024-11-12 05:01:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:24,494 INFO L93 Difference]: Finished difference Result 441 states and 613 transitions. [2024-11-12 05:01:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-12 05:01:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 10 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) Word has length 153 [2024-11-12 05:01:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:24,498 INFO L225 Difference]: With dead ends: 441 [2024-11-12 05:01:24,498 INFO L226 Difference]: Without dead ends: 357 [2024-11-12 05:01:24,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2552, Invalid=8790, Unknown=0, NotChecked=0, Total=11342 [2024-11-12 05:01:24,502 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 933 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:24,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 831 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 05:01:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-12 05:01:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 112. [2024-11-12 05:01:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 05:01:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-12 05:01:24,539 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 153 [2024-11-12 05:01:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:24,542 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-12 05:01:24,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 10 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) [2024-11-12 05:01:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-12 05:01:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 05:01:24,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:24,544 INFO L218 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, 1, 1, 1] [2024-11-12 05:01:24,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:01:24,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:24,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2023415511, now seen corresponding path program 1 times [2024-11-12 05:01:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:24,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545815539] [2024-11-12 05:01:24,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:01:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:01:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:01:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:01:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:01:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:01:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 05:01:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:01:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:01:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:01:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:01:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:01:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 05:01:24,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545815539] [2024-11-12 05:01:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545815539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:01:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607201006] [2024-11-12 05:01:24,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:24,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:01:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:24,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:01:24,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:24,861 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-11-12 05:01:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:24,901 INFO L93 Difference]: Finished difference Result 264 states and 377 transitions. [2024-11-12 05:01:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:01:24,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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 154 [2024-11-12 05:01:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:24,906 INFO L225 Difference]: With dead ends: 264 [2024-11-12 05:01:24,907 INFO L226 Difference]: Without dead ends: 155 [2024-11-12 05:01:24,907 INFO L434 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-11-12 05:01:24,908 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:24,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 239 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-12 05:01:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2024-11-12 05:01:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 108 states have internal predecessors, (151), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 05:01:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 197 transitions. [2024-11-12 05:01:24,924 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 197 transitions. Word has length 154 [2024-11-12 05:01:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:24,925 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 197 transitions. [2024-11-12 05:01:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-11-12 05:01:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 197 transitions. [2024-11-12 05:01:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 05:01:24,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:24,927 INFO L218 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, 1, 1, 1] [2024-11-12 05:01:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:01:24,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1360755373, now seen corresponding path program 1 times [2024-11-12 05:01:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591318496] [2024-11-12 05:01:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:01:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:01:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:01:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:01:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:01:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:01:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 05:01:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:01:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:01:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:01:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:01:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:01:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:01:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 05:01:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591318496] [2024-11-12 05:01:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591318496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:01:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339451687] [2024-11-12 05:01:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:01:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:01:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:25,027 INFO L87 Difference]: Start difference. First operand 137 states and 197 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-11-12 05:01:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:25,068 INFO L93 Difference]: Finished difference Result 329 states and 474 transitions. [2024-11-12 05:01:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:01:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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 154 [2024-11-12 05:01:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:25,070 INFO L225 Difference]: With dead ends: 329 [2024-11-12 05:01:25,070 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 05:01:25,070 INFO L434 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-11-12 05:01:25,071 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:25,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 273 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 05:01:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-12 05:01:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.4) internal successors, (224), 161 states have internal predecessors, (224), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 05:01:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 274 transitions. [2024-11-12 05:01:25,091 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 274 transitions. Word has length 154 [2024-11-12 05:01:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:25,092 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 274 transitions. [2024-11-12 05:01:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-11-12 05:01:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 274 transitions. [2024-11-12 05:01:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 05:01:25,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:25,095 INFO L218 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, 1, 1, 1] [2024-11-12 05:01:25,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:01:25,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:25,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 227592529, now seen corresponding path program 1 times [2024-11-12 05:01:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508813133] [2024-11-12 05:01:25,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:01:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:01:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:01:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:01:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:01:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:01:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 05:01:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:01:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:01:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:01:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:01:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 05:01:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:01:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 05:01:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508813133] [2024-11-12 05:01:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508813133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:01:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030396099] [2024-11-12 05:01:25,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:25,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:01:25,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:01:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:25,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:01:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:01:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-12 05:01:25,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:01:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 05:01:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030396099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:01:25,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:01:25,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-12 05:01:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170213701] [2024-11-12 05:01:25,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:01:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:01:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:01:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:01:25,893 INFO L87 Difference]: Start difference. First operand 192 states and 274 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-11-12 05:01:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:26,035 INFO L93 Difference]: Finished difference Result 373 states and 524 transitions. [2024-11-12 05:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:01:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 154 [2024-11-12 05:01:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:26,038 INFO L225 Difference]: With dead ends: 373 [2024-11-12 05:01:26,038 INFO L226 Difference]: Without dead ends: 184 [2024-11-12 05:01:26,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 350 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-11-12 05:01:26,040 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 176 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:26,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 244 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-12 05:01:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2024-11-12 05:01:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 146 states have internal predecessors, (195), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 05:01:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 245 transitions. [2024-11-12 05:01:26,063 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 245 transitions. Word has length 154 [2024-11-12 05:01:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 245 transitions. [2024-11-12 05:01:26,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-11-12 05:01:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 245 transitions. [2024-11-12 05:01:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 05:01:26,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:26,066 INFO L218 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, 1, 1, 1, 1] [2024-11-12 05:01:26,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:01:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:26,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash 522941064, now seen corresponding path program 1 times [2024-11-12 05:01:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311547920] [2024-11-12 05:01:26,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:01:26,330 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:01:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:01:26,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:01:26,416 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:01:26,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:01:26,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:01:26,420 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 05:01:26,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:01:26,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:01:26 BoogieIcfgContainer [2024-11-12 05:01:26,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:01:26,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:01:26,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:01:26,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:01:26,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:17" (3/4) ... [2024-11-12 05:01:26,493 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:01:26,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:01:26,495 INFO L158 Benchmark]: Toolchain (without parser) took 9883.01ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 108.7MB in the beginning and 133.9MB in the end (delta: -25.2MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,495 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:01:26,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 90.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.11ms. Allocated memory is still 176.2MB. Free memory was 90.3MB in the beginning and 146.1MB in the end (delta: -55.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,496 INFO L158 Benchmark]: Boogie Preprocessor took 79.49ms. Allocated memory is still 176.2MB. Free memory was 145.5MB in the beginning and 137.1MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,496 INFO L158 Benchmark]: RCFGBuilder took 540.41ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 105.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,496 INFO L158 Benchmark]: TraceAbstraction took 8788.90ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 104.9MB in the beginning and 133.9MB in the end (delta: -29.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-11-12 05:01:26,496 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 312.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:01:26,501 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.51ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 90.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.11ms. Allocated memory is still 176.2MB. Free memory was 90.3MB in the beginning and 146.1MB in the end (delta: -55.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.49ms. Allocated memory is still 176.2MB. Free memory was 145.5MB in the beginning and 137.1MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 540.41ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 105.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8788.90ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 104.9MB in the beginning and 133.9MB in the end (delta: -29.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 312.5MB. Free memory is still 133.9MB. 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; VAL [isInitial=0, 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=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, 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=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L176] last_1_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_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=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L187] RET updateLastVariables() [L188] 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, var_1_7=-4, var_1_9=-4] [L188] RET updateVariables() [L189] 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, 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=1073741822, 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=-16678913, var_1_6=32767, 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=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, 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=-16678913, var_1_6=32767, 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=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, var_1_7=254, var_1_9=0] [L189] RET step() [L190] 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=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, 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)) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, var_1_7=254, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=32767, var_1_7=254, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1214 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1210 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1079 mSDsCounter, 469 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 469 mSolverCounterUnsat, 644 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3203 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=4, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 272 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 3982 SizeOfPredicates, 14 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8823/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-11-12 05:01:26,534 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_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 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:01:28,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:01:28,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:01:28,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:01:28,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:01:28,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:01:28,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:01:28,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:01:28,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:01:28,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:01:28,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:01:28,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:01:28,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:01:28,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:01:28,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:01:28,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:01:28,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:01:28,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:01:28,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:01:28,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:01:28,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:01:28,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:01:28,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:01:28,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:01:28,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:01:28,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:01:28,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:01:28,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:01:28,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:01:28,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:01:28,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:01:28,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:01:28,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:01:28,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:01:28,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:28,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:01:28,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:01:28,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:01:28,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:01:28,541 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:01:28,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:01:28,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:01:28,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:01:28,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:01:28,542 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 -> 0c3661a70a060b91331a6ffdf6794dc4c4d711473c164248fb99da45bab3115a [2024-11-12 05:01:28,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:01:28,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:01:28,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:01:28,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:01:28,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:01:28,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:30,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:01:30,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:01:30,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:30,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0eff7db/332f0b49f2c94e6da84f0619a008b42e/FLAG5434805f9 [2024-11-12 05:01:30,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0eff7db/332f0b49f2c94e6da84f0619a008b42e [2024-11-12 05:01:30,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:01:30,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:01:30,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:30,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:01:30,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:01:30,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ddce53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30, skipping insertion in model container [2024-11-12 05:01:30,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:01:30,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-11-12 05:01:30,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:30,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:01:30,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i[915,928] [2024-11-12 05:01:30,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:30,739 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:01:30,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30 WrapperNode [2024-11-12 05:01:30,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:30,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:30,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:01:30,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:01:30,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,807 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-12 05:01:30,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:30,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:01:30,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:01:30,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:01:30,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,847 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:01:30,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:01:30,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:01:30,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:01:30,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:01:30,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (1/1) ... [2024-11-12 05:01:30,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:30,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:01:30,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:01:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:01:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:01:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:01:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:01:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:01:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:01:31,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:01:31,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:01:47,402 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 05:01:47,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:01:47,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:01:47,416 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:01:47,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:47 BoogieIcfgContainer [2024-11-12 05:01:47,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:01:47,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:01:47,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:01:47,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:01:47,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:01:30" (1/3) ... [2024-11-12 05:01:47,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603874df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:47, skipping insertion in model container [2024-11-12 05:01:47,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:30" (2/3) ... [2024-11-12 05:01:47,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603874df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:47, skipping insertion in model container [2024-11-12 05:01:47,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:47" (3/3) ... [2024-11-12 05:01:47,423 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-6.i [2024-11-12 05:01:47,435 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:01:47,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:01:47,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:01:47,496 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;@6228eda3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:01:47,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:01:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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-11-12 05:01:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 05:01:47,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:47,510 INFO L218 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-11-12 05:01:47,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:47,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash -890735175, now seen corresponding path program 1 times [2024-11-12 05:01:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:01:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194627217] [2024-11-12 05:01:47,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:47,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:01:47,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:01:47,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:01:47,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:01:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:01:48,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:01:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-12 05:01:48,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:01:48,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:01:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194627217] [2024-11-12 05:01:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194627217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:48,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:01:48,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392436997] [2024-11-12 05:01:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:01:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:01:48,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:01:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:48,692 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-11-12 05:01:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:48,724 INFO L93 Difference]: Finished difference Result 158 states and 270 transitions. [2024-11-12 05:01:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:01:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 151 [2024-11-12 05:01:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:48,733 INFO L225 Difference]: With dead ends: 158 [2024-11-12 05:01:48,734 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 05:01:48,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:48,741 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:48,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 05:01:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 05:01:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-11-12 05:01:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-11-12 05:01:48,796 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 151 [2024-11-12 05:01:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:48,796 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-11-12 05:01:48,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-11-12 05:01:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-11-12 05:01:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 05:01:48,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:48,800 INFO L218 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-11-12 05:01:48,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:01:49,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:01:49,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash -272370829, now seen corresponding path program 1 times [2024-11-12 05:01:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:01:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050428377] [2024-11-12 05:01:49,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:49,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:01:49,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:01:49,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:01:49,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:01:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:50,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 05:01:50,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:01:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-12 05:01:52,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:01:55,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:01:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050428377] [2024-11-12 05:01:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050428377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:01:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753071283] [2024-11-12 05:01:55,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 05:01:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 05:01:55,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 05:01:55,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 05:01:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:58,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:01:58,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:02:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-12 05:02:00,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:02:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [753071283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:02:01,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:02:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2024-11-12 05:02:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471411785] [2024-11-12 05:02:01,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:02:01,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:02:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:02:01,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:02:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:02:01,112 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 05:02:10,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 05:02:14,401 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 [0] [2024-11-12 05:02:18,409 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 [0] [2024-11-12 05:02:22,416 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 [0] [2024-11-12 05:02:26,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:02:30,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:02:34,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:02:38,961 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 [0] [2024-11-12 05:02:42,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:02:46,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:02:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:53,778 INFO L93 Difference]: Finished difference Result 281 states and 419 transitions. [2024-11-12 05:02:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 05:02:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-12 05:02:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:53,783 INFO L225 Difference]: With dead ends: 281 [2024-11-12 05:02:53,783 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 05:02:53,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-12 05:02:53,785 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 259 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 143 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:53,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 605 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 468 Invalid, 10 Unknown, 0 Unchecked, 48.6s Time] [2024-11-12 05:02:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 05:02:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 87. [2024-11-12 05:02:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 05:02:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-11-12 05:02:53,807 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 151 [2024-11-12 05:02:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-11-12 05:02:53,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 05:02:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-11-12 05:02:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 05:02:53,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:53,810 INFO L218 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, 1] [2024-11-12 05:02:53,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 05:02:54,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:02:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:02:54,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -414200702, now seen corresponding path program 1 times [2024-11-12 05:02:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:02:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041486035] [2024-11-12 05:02:54,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:02:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:02:54,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:02:54,216 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 (5)] Waiting until timeout for monitored process