./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-21.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 132f6e59bc9f1507b44777f2d380124cf3d51d77815ba3c2a3bb8fb181547a65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:29:07,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:29:07,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:29:07,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:29:07,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:29:07,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:29:07,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:29:07,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:29:07,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:29:07,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:29:07,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:29:07,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:29:07,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:29:07,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:29:07,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:29:07,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:29:07,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:29:07,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 132f6e59bc9f1507b44777f2d380124cf3d51d77815ba3c2a3bb8fb181547a65 [2025-03-03 23:29:07,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:29:07,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:29:07,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:29:07,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:29:07,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:29:07,581 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-21.i [2025-03-03 23:29:08,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262cb35ea/fd6493498bf34f77b72ab606b09ecf53/FLAG47587b55e [2025-03-03 23:29:09,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:29:09,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-21.i [2025-03-03 23:29:09,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262cb35ea/fd6493498bf34f77b72ab606b09ecf53/FLAG47587b55e [2025-03-03 23:29:09,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262cb35ea/fd6493498bf34f77b72ab606b09ecf53 [2025-03-03 23:29:09,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:29:09,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:29:09,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:29:09,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:29:09,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:29:09,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0077c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09, skipping insertion in model container [2025-03-03 23:29:09,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:29:09,429 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-21.i[915,928] [2025-03-03 23:29:09,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:29:09,505 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:29:09,513 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-21.i[915,928] [2025-03-03 23:29:09,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:29:09,559 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:29:09,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09 WrapperNode [2025-03-03 23:29:09,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:29:09,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:29:09,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:29:09,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:29:09,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,614 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-03 23:29:09,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:29:09,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:29:09,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:29:09,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:29:09,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,653 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]. [2025-03-03 23:29:09,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:29:09,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:29:09,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:29:09,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:29:09,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (1/1) ... [2025-03-03 23:29:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:29:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:29:09,695 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) [2025-03-03 23:29:09,697 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 [2025-03-03 23:29:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:29:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:29:09,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:29:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:29:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:29:09,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:29:09,776 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:29:09,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:29:10,022 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-03-03 23:29:10,044 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:29:10,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:29:10,054 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:29:10,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:29:10,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:10 BoogieIcfgContainer [2025-03-03 23:29:10,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:29:10,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:29:10,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:29:10,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:29:10,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:29:09" (1/3) ... [2025-03-03 23:29:10,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d775bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:10, skipping insertion in model container [2025-03-03 23:29:10,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:09" (2/3) ... [2025-03-03 23:29:10,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d775bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:10, skipping insertion in model container [2025-03-03 23:29:10,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:10" (3/3) ... [2025-03-03 23:29:10,064 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-21.i [2025-03-03 23:29:10,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:29:10,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-21.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:29:10,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:29:10,135 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;@14c890a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:29:10,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:29:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:29:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:29:10,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:10,149 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:10,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1537336536, now seen corresponding path program 1 times [2025-03-03 23:29:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:29:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605894450] [2025-03-03 23:29:10,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:10,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:29:10,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:29:10,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:29:10,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:10,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 23:29:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:29:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605894450] [2025-03-03 23:29:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605894450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:29:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679950761] [2025-03-03 23:29:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:10,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:29:10,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:29:10,395 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) [2025-03-03 23:29:10,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:29:10,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:29:10,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:29:10,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:10,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:29:10,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:29:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 23:29:10,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:29:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679950761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:29:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:29:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375386302] [2025-03-03 23:29:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:29:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:29:10,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:29:10,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:29:10,574 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:29:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:10,598 INFO L93 Difference]: Finished difference Result 143 states and 233 transitions. [2025-03-03 23:29:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:29:10,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-03 23:29:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:10,606 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:29:10,606 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:29:10,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:29:10,612 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:29:10,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:29:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:29:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 23:29:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:29:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2025-03-03 23:29:10,651 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 144 [2025-03-03 23:29:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:10,651 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-03 23:29:10,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:29:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2025-03-03 23:29:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:29:10,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:10,654 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:10,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:29:10,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:29:10,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -57568124, now seen corresponding path program 1 times [2025-03-03 23:29:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:29:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237086573] [2025-03-03 23:29:10,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:29:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:29:10,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:29:10,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:29:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:29:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237086573] [2025-03-03 23:29:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237086573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:29:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:29:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800524293] [2025-03-03 23:29:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:29:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:29:12,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:29:12,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:29:12,046 INFO L87 Difference]: Start difference. First operand 70 states and 102 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:12,377 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2025-03-03 23:29:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:29:12,378 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-03 23:29:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:12,379 INFO L225 Difference]: With dead ends: 205 [2025-03-03 23:29:12,379 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 23:29:12,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:29:12,380 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 118 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:29:12,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 371 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:29:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 23:29:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2025-03-03 23:29:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 89 states have internal predecessors, (115), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:29:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2025-03-03 23:29:12,401 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 144 [2025-03-03 23:29:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:12,402 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2025-03-03 23:29:12,402 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2025-03-03 23:29:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:29:12,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:12,403 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:12,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:29:12,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:12,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 71514595, now seen corresponding path program 1 times [2025-03-03 23:29:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:29:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759832320] [2025-03-03 23:29:12,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:29:12,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:29:12,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:29:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:29:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:29:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759832320] [2025-03-03 23:29:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759832320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:29:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:29:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561867117] [2025-03-03 23:29:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:29:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:29:12,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:29:12,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:29:12,496 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:12,515 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2025-03-03 23:29:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:29:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-03 23:29:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:12,518 INFO L225 Difference]: With dead ends: 231 [2025-03-03 23:29:12,518 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 23:29:12,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:29:12,519 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:29:12,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:29:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 23:29:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 23:29:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:29:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-03-03 23:29:12,535 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 144 [2025-03-03 23:29:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:12,536 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-03-03 23:29:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-03-03 23:29:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:29:12,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:12,540 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:12,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:29:12,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -563126749, now seen corresponding path program 1 times [2025-03-03 23:29:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:29:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832061497] [2025-03-03 23:29:12,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:29:12,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:29:12,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:29:12,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:12,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:29:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:29:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832061497] [2025-03-03 23:29:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832061497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:12,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:29:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:29:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211171241] [2025-03-03 23:29:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:29:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:29:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:29:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:29:12,609 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:12,640 INFO L93 Difference]: Finished difference Result 200 states and 281 transitions. [2025-03-03 23:29:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:29:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-03 23:29:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:12,642 INFO L225 Difference]: With dead ends: 200 [2025-03-03 23:29:12,642 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 23:29:12,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:29:12,643 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:29:12,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:29:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 23:29:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 23:29:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:29:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-03-03 23:29:12,665 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 144 [2025-03-03 23:29:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:12,665 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-03-03 23:29:12,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:29:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-03-03 23:29:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 23:29:12,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:12,668 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:29:12,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -171645795, now seen corresponding path program 1 times [2025-03-03 23:29:12,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:29:12,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244553746] [2025-03-03 23:29:12,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:29:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 23:29:12,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 23:29:12,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:12,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:29:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934975779] [2025-03-03 23:29:12,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:29:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:29:12,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:29:12,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:29:12,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 23:29:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 23:29:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:29:12,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:29:12,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 23:29:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 23:29:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:12,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:29:13,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:29:13,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:29:13,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:29:13,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:29:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:29:13,254 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 23:29:13,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:29:13,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:29:13 BoogieIcfgContainer [2025-03-03 23:29:13,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:29:13,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:29:13,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:29:13,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:29:13,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:10" (3/4) ... [2025-03-03 23:29:13,333 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:29:13,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:29:13,334 INFO L158 Benchmark]: Toolchain (without parser) took 4013.49ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 113.2MB in the beginning and 192.4MB in the end (delta: -79.3MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. [2025-03-03 23:29:13,334 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:29:13,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.08ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 98.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:29:13,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:29:13,337 INFO L158 Benchmark]: Boogie Preprocessor took 52.00ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:29:13,337 INFO L158 Benchmark]: IcfgBuilder took 388.43ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 62.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:29:13,338 INFO L158 Benchmark]: TraceAbstraction took 3270.10ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 61.9MB in the beginning and 192.4MB in the end (delta: -130.5MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2025-03-03 23:29:13,338 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 369.1MB. Free memory is still 192.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:29:13,339 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.08ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 98.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.00ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 388.43ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 62.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3270.10ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 61.9MB in the beginning and 192.4MB in the end (delta: -130.5MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 369.1MB. Free memory is still 192.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] unsigned short int last_1_var_1_8 = 8; [L43] unsigned char last_1_var_1_12 = 8; [L44] unsigned short int last_1_var_1_13 = 16; [L45] unsigned char last_1_var_1_17 = 0; [L46] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] isInitial = 1 [L134] FCALL initially() [L135] int k_loop; [L136] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] COND TRUE k_loop < 1 [L137] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_12 = var_1_12 [L124] last_1_var_1_13 = var_1_13 [L125] last_1_var_1_17 = var_1_17 [L126] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L86] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L88] var_1_4 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L89] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L92] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L95] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L96] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L96] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=32, var_1_8=8] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L99] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L99] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L101] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L102] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L102] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L104] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L108] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L108] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L109] var_1_20 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L111] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L111] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L113] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L114] var_1_22 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L115] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L116] var_1_23 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L117] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L118] var_1_24 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L119] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L138] RET updateVariables() [L139] CALL step() [L50] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L51] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L55] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L56] COND TRUE last_1_var_1_13 == stepLocal_1 [L57] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=8] [L59] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L60] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L61] COND TRUE var_1_8 >= stepLocal_0 [L62] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L66] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=0, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L67] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L68] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L70] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L71] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L73] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-32769, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L74] COND FALSE !(\read(var_1_17)) [L81] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L139] RET step() [L140] CALL, EXPR property() [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L129] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L129-L130] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-32769, var_1_12=0, var_1_13=0, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=31, var_1_7=0, var_1_8=32798] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 851 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 442 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 409 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 1012 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4578/4620 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:29:13,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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/21.0.5-tem/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.6.800.v20240513-1750.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-21.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 132f6e59bc9f1507b44777f2d380124cf3d51d77815ba3c2a3bb8fb181547a65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:29:15,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:29:15,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:29:15,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:29:15,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:29:15,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:29:15,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:29:15,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:29:15,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:29:15,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:29:15,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:29:15,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:29:15,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:29:15,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:29:15,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:29:15,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:29:15,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:29:15,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:29:15,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:29:15,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:29:15,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 132f6e59bc9f1507b44777f2d380124cf3d51d77815ba3c2a3bb8fb181547a65 [2025-03-03 23:29:15,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:29:15,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:29:15,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:29:15,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:29:15,507 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:29:15,509 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-21.i [2025-03-03 23:29:16,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3468d80/444e8a8a6c7b44828db2e3e2c5d45e2b/FLAG3c52e98b8 [2025-03-03 23:29:16,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:29:16,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-21.i [2025-03-03 23:29:16,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3468d80/444e8a8a6c7b44828db2e3e2c5d45e2b/FLAG3c52e98b8 [2025-03-03 23:29:16,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3468d80/444e8a8a6c7b44828db2e3e2c5d45e2b [2025-03-03 23:29:16,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:29:16,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:29:16,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:29:16,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:29:16,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:29:16,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:29:16" (1/1) ... [2025-03-03 23:29:16,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5667a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:16, skipping insertion in model container [2025-03-03 23:29:16,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:29:16" (1/1) ... [2025-03-03 23:29:16,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:29:17,028 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-21.i[915,928] [2025-03-03 23:29:17,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:29:17,102 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:29:17,112 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-21.i[915,928] [2025-03-03 23:29:17,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:29:17,171 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:29:17,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17 WrapperNode [2025-03-03 23:29:17,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:29:17,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:29:17,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:29:17,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:29:17,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,217 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-03 23:29:17,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:29:17,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:29:17,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:29:17,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:29:17,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,246 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]. [2025-03-03 23:29:17,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:29:17,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:29:17,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:29:17,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:29:17,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (1/1) ... [2025-03-03 23:29:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:29:17,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:29:17,291 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) [2025-03-03 23:29:17,294 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 [2025-03-03 23:29:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:29:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:29:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:29:17,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:29:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:29:17,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:29:17,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:29:17,380 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:29:19,153 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 23:29:19,154 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:29:19,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:29:19,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:29:19,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:19 BoogieIcfgContainer [2025-03-03 23:29:19,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:29:19,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:29:19,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:29:19,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:29:19,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:29:16" (1/3) ... [2025-03-03 23:29:19,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec8923c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:19, skipping insertion in model container [2025-03-03 23:29:19,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:29:17" (2/3) ... [2025-03-03 23:29:19,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec8923c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:19, skipping insertion in model container [2025-03-03 23:29:19,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:19" (3/3) ... [2025-03-03 23:29:19,168 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-21.i [2025-03-03 23:29:19,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:29:19,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-21.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:29:19,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:29:19,224 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;@438fc32c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:29:19,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:29:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:29:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 23:29:19,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:19,237 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:19,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:19,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1331030186, now seen corresponding path program 1 times [2025-03-03 23:29:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:29:19,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37073868] [2025-03-03 23:29:19,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:19,248 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 [2025-03-03 23:29:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:29:19,250 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) [2025-03-03 23:29:19,251 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 [2025-03-03 23:29:19,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 23:29:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 23:29:19,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:19,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:19,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:29:19,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:29:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 23:29:19,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:29:19,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:29:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37073868] [2025-03-03 23:29:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37073868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:29:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:29:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137913968] [2025-03-03 23:29:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:29:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:29:19,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:29:19,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:29:19,542 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:29:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:19,557 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2025-03-03 23:29:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:29:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-03 23:29:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:19,565 INFO L225 Difference]: With dead ends: 125 [2025-03-03 23:29:19,565 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 23:29:19,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:29:19,569 INFO L435 NwaCegarLoop]: 92 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, 92 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 [2025-03-03 23:29:19,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:29:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 23:29:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 23:29:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:29:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2025-03-03 23:29:19,596 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 142 [2025-03-03 23:29:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:19,596 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-03-03 23:29:19,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:29:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2025-03-03 23:29:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 23:29:19,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:19,598 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:29:19,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:29:19,799 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 [2025-03-03 23:29:19,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1301285126, now seen corresponding path program 1 times [2025-03-03 23:29:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:29:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227330516] [2025-03-03 23:29:19,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:19,804 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 [2025-03-03 23:29:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:29:19,806 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) [2025-03-03 23:29:19,807 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 [2025-03-03 23:29:19,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 23:29:20,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 23:29:20,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:20,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:20,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 23:29:20,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:30:23,758 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)