./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_50-1loop_file-91.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 f1ce21c01c2e05362b76de257bb917b71242bab88b48edee551a032b96502fbb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:09:02,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:09:02,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:09:02,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:09:02,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:09:02,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:09:02,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:09:02,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:09:02,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:09:02,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:09:02,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:09:02,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:09:02,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:09:02,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:09:02,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:09:02,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:09:02,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:09:02,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:09:02,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:09:02,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:09:02,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:09:02,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:09:02,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:09:02,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:09:02,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:09:02,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:09:02,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:09:02,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:09:02,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:09:02,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:09:02,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:09:02,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:09:02,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:09:02,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:09:02,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:09:02,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:09:02,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:09:02,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:09:02,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:09:02,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:09:02,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:09:02,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:09:02,462 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 -> f1ce21c01c2e05362b76de257bb917b71242bab88b48edee551a032b96502fbb [2024-11-09 00:09:02,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:09:02,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:09:02,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:09:02,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:09:02,757 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:09:02,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:04,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:09:04,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:09:04,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:04,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c59065bb/cb9d6191ffbb4aa4826d5f227d4394af/FLAGdc0fa46c0 [2024-11-09 00:09:04,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c59065bb/cb9d6191ffbb4aa4826d5f227d4394af [2024-11-09 00:09:04,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:09:04,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:09:04,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:09:04,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:09:04,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:09:04,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:04" (1/1) ... [2024-11-09 00:09:04,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ce6ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:04, skipping insertion in model container [2024-11-09 00:09:04,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:04" (1/1) ... [2024-11-09 00:09:04,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:09:04,873 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_50-1loop_file-91.i[915,928] [2024-11-09 00:09:04,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:09:04,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:09:04,990 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_50-1loop_file-91.i[915,928] [2024-11-09 00:09:05,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:09:05,063 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:09:05,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05 WrapperNode [2024-11-09 00:09:05,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:09:05,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:09:05,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:09:05,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:09:05,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,129 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-09 00:09:05,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:09:05,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:09:05,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:09:05,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:09:05,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,189 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-09 00:09:05,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:09:05,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:09:05,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:09:05,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:09:05,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (1/1) ... [2024-11-09 00:09:05,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:09:05,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:09:05,268 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-09 00:09:05,273 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-09 00:09:05,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:09:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:09:05,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:09:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:09:05,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:09:05,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:09:05,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:09:05,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:09:05,810 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-09 00:09:05,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:09:05,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:09:05,835 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:09:05,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:05 BoogieIcfgContainer [2024-11-09 00:09:05,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:09:05,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:09:05,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:09:05,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:09:05,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:09:04" (1/3) ... [2024-11-09 00:09:05,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80bd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:05, skipping insertion in model container [2024-11-09 00:09:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:05" (2/3) ... [2024-11-09 00:09:05,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80bd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:05, skipping insertion in model container [2024-11-09 00:09:05,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:05" (3/3) ... [2024-11-09 00:09:05,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:05,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:09:05,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:09:05,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:09:05,970 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;@67a61e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:09:05,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:09:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:09:05,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:05,988 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:05,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1084981206, now seen corresponding path program 1 times [2024-11-09 00:09:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090227687] [2024-11-09 00:09:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:09:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:09:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:09:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:09:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:09:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:09:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:09:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:09:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:09:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:09:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:09:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:09:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:09:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:09:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:09:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:09:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:09:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:09:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:09:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:09:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:09:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:09:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090227687] [2024-11-09 00:09:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090227687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:09:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248031546] [2024-11-09 00:09:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:09:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:09:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:09:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:09:06,622 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:09:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:06,658 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2024-11-09 00:09:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:09:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2024-11-09 00:09:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:06,670 INFO L225 Difference]: With dead ends: 127 [2024-11-09 00:09:06,671 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 00:09:06,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-09 00:09:06,680 INFO L432 NwaCegarLoop]: 94 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, 94 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-09 00:09:06,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:09:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 00:09:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 00:09:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-09 00:09:06,732 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 130 [2024-11-09 00:09:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:06,732 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-09 00:09:06,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:09:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-09 00:09:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:09:06,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:06,738 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:09:06,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 272755866, now seen corresponding path program 1 times [2024-11-09 00:09:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:06,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182739002] [2024-11-09 00:09:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:09:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:09:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:09:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:09:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:09:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:09:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:09:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:09:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:09:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:09:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:09:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:09:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:09:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:09:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:09:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:09:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:09:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:09:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:09:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:09:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:09:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:09:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182739002] [2024-11-09 00:09:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182739002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:09:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501857623] [2024-11-09 00:09:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:09:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:09:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:09:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:09:07,116 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:07,186 INFO L93 Difference]: Finished difference Result 174 states and 258 transitions. [2024-11-09 00:09:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:09:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-09 00:09:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:07,191 INFO L225 Difference]: With dead ends: 174 [2024-11-09 00:09:07,193 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 00:09:07,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-09 00:09:07,197 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:07,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 245 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:09:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 00:09:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 63. [2024-11-09 00:09:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-09 00:09:07,226 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 130 [2024-11-09 00:09:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:07,231 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-09 00:09:07,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-09 00:09:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:09:07,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:07,236 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:07,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:09:07,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 784178454, now seen corresponding path program 1 times [2024-11-09 00:09:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333994059] [2024-11-09 00:09:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:09:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:09:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:09:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:09:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:09:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:09:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:09:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:09:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:09:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:09:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:09:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:09:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:09:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:09:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:09:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:09:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:09:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:09:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:09:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:09:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:09:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:09:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333994059] [2024-11-09 00:09:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333994059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:09:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528193710] [2024-11-09 00:09:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:07,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:09:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:09:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:09:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:09:07,905 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:08,462 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2024-11-09 00:09:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:09:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-09 00:09:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:08,466 INFO L225 Difference]: With dead ends: 180 [2024-11-09 00:09:08,466 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 00:09:08,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:09:08,468 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:08,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 287 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:09:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 00:09:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 64. [2024-11-09 00:09:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-11-09 00:09:08,496 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 131 [2024-11-09 00:09:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-11-09 00:09:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-09 00:09:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:09:08,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:08,500 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:09:08,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash -288540747, now seen corresponding path program 1 times [2024-11-09 00:09:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341766142] [2024-11-09 00:09:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:09:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702342693] [2024-11-09 00:09:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:09:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:09:08,600 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-09 00:09:08,602 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-09 00:09:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:09:09,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:09:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:09:09,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:09:09,239 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:09:09,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:09:09,253 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-09 00:09:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:09:09,446 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:09:09,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:09:09,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:09:09 BoogieIcfgContainer [2024-11-09 00:09:09,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:09:09,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:09:09,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:09:09,578 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:09:09,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:05" (3/4) ... [2024-11-09 00:09:09,583 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:09:09,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:09:09,586 INFO L158 Benchmark]: Toolchain (without parser) took 4960.25ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 141.0MB in the beginning and 125.3MB in the end (delta: 15.7MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,586 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:09:09,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.98ms. Allocated memory is still 172.0MB. Free memory was 140.8MB in the beginning and 128.1MB in the end (delta: 12.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.62ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,589 INFO L158 Benchmark]: Boogie Preprocessor took 84.21ms. Allocated memory is still 172.0MB. Free memory was 123.9MB in the beginning and 116.2MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,589 INFO L158 Benchmark]: RCFGBuilder took 619.35ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 94.6MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,589 INFO L158 Benchmark]: TraceAbstraction took 3737.75ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 93.9MB in the beginning and 125.3MB in the end (delta: -31.4MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-09 00:09:09,589 INFO L158 Benchmark]: Witness Printer took 5.93ms. Allocated memory is still 207.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:09:09,594 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.24ms. Allocated memory is still 130.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.98ms. Allocated memory is still 172.0MB. Free memory was 140.8MB in the beginning and 128.1MB in the end (delta: 12.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.62ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.21ms. Allocated memory is still 172.0MB. Free memory was 123.9MB in the beginning and 116.2MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 619.35ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 94.6MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3737.75ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 93.9MB in the beginning and 125.3MB in the end (delta: -31.4MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 5.93ms. Allocated memory is still 207.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed short int var_1_5 = 8; [L24] signed short int var_1_6 = 8; [L25] signed short int var_1_7 = 5; [L26] signed short int var_1_8 = 0; [L27] signed char var_1_9 = 5; [L28] signed char var_1_11 = 16; [L29] signed short int var_1_12 = 25; [L30] signed short int var_1_13 = 64; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L33] float var_1_17 = 1.2; [L34] float var_1_18 = 5.8; [L35] float var_1_19 = 10.25; [L36] float var_1_20 = 2.5; [L37] signed short int var_1_21 = 200; [L38] unsigned char var_1_24 = 1; [L39] unsigned char var_1_25 = 0; [L40] signed char var_1_26 = -5; [L41] signed short int last_1_var_1_1 = -64; [L42] signed short int last_1_var_1_13 = 64; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_26 = -5; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_15 = var_1_15 [L130] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] var_1_6 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L100] var_1_7 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L103] var_1_8 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] var_1_12 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] var_1_18 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_20 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L142] RET updateVariables() [L143] CALL step() [L48] COND FALSE !(last_1_var_1_13 == last_1_var_1_1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L55] signed long int stepLocal_3 = (var_1_6 + var_1_8) - var_1_5; [L56] signed short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_2=-64, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L57] COND FALSE !(var_1_11 < stepLocal_2) [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L66] COND TRUE var_1_11 < 5 [L67] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_24 = var_1_25 [L70] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L71] COND FALSE !(\read(var_1_24)) [L76] var_1_21 = (var_1_15 - 2) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L78] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L79] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L82] COND TRUE stepLocal_0 <= (var_1_21 / var_1_12) [L83] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L88] signed long int stepLocal_1 = var_1_1 * (var_1_15 % var_1_12); VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_1=0, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L89] COND TRUE (- var_1_15) >= stepLocal_1 [L90] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-1, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L143] RET step() [L144] CALL, EXPR property() [L133-L134] return ((((((((last_1_var_1_13 == last_1_var_1_1) ? ((last_1_var_1_1 <= ((((last_1_var_1_13) > (last_1_var_1_26)) ? (last_1_var_1_13) : (last_1_var_1_26)))) ? (var_1_1 == ((signed short int) (last_1_var_1_1 + (((((last_1_var_1_15 - last_1_var_1_15)) < ((last_1_var_1_15 - last_1_var_1_15))) ? ((last_1_var_1_15 - last_1_var_1_15)) : ((last_1_var_1_15 - last_1_var_1_15))))))) : (var_1_1 == ((signed short int) (((((last_1_var_1_15 - last_1_var_1_15)) < (((last_1_var_1_15 - last_1_var_1_15) + -256))) ? ((last_1_var_1_15 - last_1_var_1_15)) : (((last_1_var_1_15 - last_1_var_1_15) + -256))))))) : 1) && (var_1_24 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_15 <= (var_1_21 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_15) >= (var_1_1 * (var_1_15 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_26)) : 1)) && ((var_1_11 < var_1_1) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_24 ? ((var_1_24 && var_1_24) ? (var_1_21 == ((signed short int) var_1_15)) : 1) : (var_1_21 == ((signed short int) (var_1_15 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-1, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 626 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 367 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 109 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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-09 00:09:09,622 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_50-1loop_file-91.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 f1ce21c01c2e05362b76de257bb917b71242bab88b48edee551a032b96502fbb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:09:12,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:09:12,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:09:12,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:09:12,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:09:12,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:09:12,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:09:12,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:09:12,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:09:12,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:09:12,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:09:12,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:09:12,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:09:12,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:09:12,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:09:12,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:09:12,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:09:12,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:09:12,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:09:12,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:09:12,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:09:12,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:09:12,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:09:12,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:09:12,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:09:12,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:09:12,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:09:12,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:09:12,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:09:12,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:09:12,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:09:12,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:09:12,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:09:12,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:09:12,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:09:12,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:09:12,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:09:12,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:09:12,261 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:09:12,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:09:12,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:09:12,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:09:12,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:09:12,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:09:12,262 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 -> f1ce21c01c2e05362b76de257bb917b71242bab88b48edee551a032b96502fbb [2024-11-09 00:09:12,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:09:12,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:09:12,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:09:12,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:09:12,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:09:12,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:14,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:09:14,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:09:14,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:14,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9a8a78e/49a1d8c2426c43f480365473a3c85bbe/FLAGd3ad28350 [2024-11-09 00:09:14,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9a8a78e/49a1d8c2426c43f480365473a3c85bbe [2024-11-09 00:09:14,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:09:14,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:09:14,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:09:14,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:09:14,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:09:14,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:14" (1/1) ... [2024-11-09 00:09:14,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd0ec24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:14, skipping insertion in model container [2024-11-09 00:09:14,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:14" (1/1) ... [2024-11-09 00:09:14,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:09:15,219 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_50-1loop_file-91.i[915,928] [2024-11-09 00:09:15,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:09:15,345 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:09:15,361 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_50-1loop_file-91.i[915,928] [2024-11-09 00:09:15,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:09:15,433 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:09:15,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15 WrapperNode [2024-11-09 00:09:15,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:09:15,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:09:15,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:09:15,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:09:15,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,496 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-09 00:09:15,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:09:15,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:09:15,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:09:15,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:09:15,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,540 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-09 00:09:15,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:09:15,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:09:15,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:09:15,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:09:15,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (1/1) ... [2024-11-09 00:09:15,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:09:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:09:15,615 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-09 00:09:15,617 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-09 00:09:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:09:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:09:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:09:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:09:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:09:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:09:15,750 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:09:15,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:09:16,574 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-09 00:09:16,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:09:16,591 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:09:16,592 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:09:16,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:16 BoogieIcfgContainer [2024-11-09 00:09:16,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:09:16,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:09:16,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:09:16,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:09:16,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:09:14" (1/3) ... [2024-11-09 00:09:16,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5132f7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:16, skipping insertion in model container [2024-11-09 00:09:16,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:15" (2/3) ... [2024-11-09 00:09:16,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5132f7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:16, skipping insertion in model container [2024-11-09 00:09:16,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:16" (3/3) ... [2024-11-09 00:09:16,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-91.i [2024-11-09 00:09:16,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:09:16,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:09:16,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:09:16,714 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;@55d4f5ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:09:16,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:09:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:09:16,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:16,737 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:16,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1084981206, now seen corresponding path program 1 times [2024-11-09 00:09:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:09:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971230743] [2024-11-09 00:09:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:16,765 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-09 00:09:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:09:16,767 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-09 00:09:16,772 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-09 00:09:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:17,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:09:17,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:09:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-09 00:09:17,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:09:17,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:09:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971230743] [2024-11-09 00:09:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971230743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:09:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601901358] [2024-11-09 00:09:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:17,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:09:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:09:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:09:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:09:17,220 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:09:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:17,255 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2024-11-09 00:09:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:09:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2024-11-09 00:09:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:17,266 INFO L225 Difference]: With dead ends: 127 [2024-11-09 00:09:17,266 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 00:09:17,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-09 00:09:17,277 INFO L432 NwaCegarLoop]: 94 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, 94 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-09 00:09:17,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:09:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 00:09:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 00:09:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-09 00:09:17,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 130 [2024-11-09 00:09:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-09 00:09:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:09:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-09 00:09:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:09:17,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:17,342 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:17,355 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:09:17,543 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-09 00:09:17,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:17,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash 272755866, now seen corresponding path program 1 times [2024-11-09 00:09:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:09:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077770127] [2024-11-09 00:09:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:17,546 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-09 00:09:17,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:09:17,551 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-09 00:09:17,552 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-09 00:09:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:17,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:09:17,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:09:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:09:18,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:09:18,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:09:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077770127] [2024-11-09 00:09:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077770127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:09:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082946301] [2024-11-09 00:09:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:09:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:09:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:09:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:09:18,075 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:19,242 INFO L93 Difference]: Finished difference Result 178 states and 257 transitions. [2024-11-09 00:09:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:09:19,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-09 00:09:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:19,246 INFO L225 Difference]: With dead ends: 178 [2024-11-09 00:09:19,247 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 00:09:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:09:19,249 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 285 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 00:09:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 00:09:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 64. [2024-11-09 00:09:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:09:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-11-09 00:09:19,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 130 [2024-11-09 00:09:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:19,271 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-11-09 00:09:19,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:09:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-09 00:09:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:09:19,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:19,274 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:09:19,288 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-09 00:09:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:09:19,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -288540747, now seen corresponding path program 1 times [2024-11-09 00:09:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:09:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480004127] [2024-11-09 00:09:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:19,478 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-09 00:09:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:09:19,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:09:19,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:09:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:19,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 00:09:19,875 INFO L278 TraceCheckSpWp]: Computing forward predicates...