./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_codestructure_dependencies_file-62.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 b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:58:06,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:58:06,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:58:06,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:58:06,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:58:06,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:58:06,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:58:06,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:58:06,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:58:06,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:58:06,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:58:06,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:58:06,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:58:06,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:58:06,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:58:06,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:58:06,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:58:06,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:06,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:58:06,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:58:06,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:58:06,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:58:06,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:58:06,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:58:06,674 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 -> b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b [2025-03-16 22:58:06,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:58:06,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:58:06,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:58:06,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:58:06,901 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:58:06,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:08,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d11703f4/e009711989a842aca9655713e1ab2bbc/FLAGa8333cb8b [2025-03-16 22:58:08,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:58:08,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:08,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d11703f4/e009711989a842aca9655713e1ab2bbc/FLAGa8333cb8b [2025-03-16 22:58:08,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d11703f4/e009711989a842aca9655713e1ab2bbc [2025-03-16 22:58:08,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:58:08,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:58:08,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:08,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:58:08,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:58:08,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c776f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08, skipping insertion in model container [2025-03-16 22:58:08,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:58:08,498 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_codestructure_dependencies_file-62.i[919,932] [2025-03-16 22:58:08,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:08,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:58:08,565 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_codestructure_dependencies_file-62.i[919,932] [2025-03-16 22:58:08,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:08,589 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:58:08,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08 WrapperNode [2025-03-16 22:58:08,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:08,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:08,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:58:08,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:58:08,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,621 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-16 22:58:08,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:08,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:58:08,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:58:08,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:58:08,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,643 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-16 22:58:08,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:58:08,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:58:08,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:58:08,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:58:08,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (1/1) ... [2025-03-16 22:58:08,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:08,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:08,689 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-16 22:58:08,692 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-16 22:58:08,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:58:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:58:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:58:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:58:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:58:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:58:08,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:58:08,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:58:08,999 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-03-16 22:58:09,025 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 22:58:09,026 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:58:09,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:58:09,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:58:09,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:09 BoogieIcfgContainer [2025-03-16 22:58:09,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:58:09,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:58:09,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:58:09,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:58:09,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:58:08" (1/3) ... [2025-03-16 22:58:09,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e7672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:09, skipping insertion in model container [2025-03-16 22:58:09,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:08" (2/3) ... [2025-03-16 22:58:09,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e7672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:09, skipping insertion in model container [2025-03-16 22:58:09,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:09" (3/3) ... [2025-03-16 22:58:09,047 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:09,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:58:09,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-62.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:58:09,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:58:09,116 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;@6a30fadd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:58:09,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:58:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 43 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 22:58:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 22:58:09,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:09,127 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:09,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1594213230, now seen corresponding path program 1 times [2025-03-16 22:58:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016890983] [2025-03-16 22:58:09,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:09,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-16 22:58:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016890983] [2025-03-16 22:58:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016890983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:58:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803267663] [2025-03-16 22:58:09,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:09,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:09,349 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-16 22:58:09,351 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-16 22:58:09,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:09,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:09,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:09,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:09,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:58:09,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-16 22:58:09,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803267663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:58:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:58:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400414676] [2025-03-16 22:58:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:58:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:09,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:58:09,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:09,528 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 43 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 22:58:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:09,543 INFO L93 Difference]: Finished difference Result 121 states and 209 transitions. [2025-03-16 22:58:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:58:09,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2025-03-16 22:58:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:09,549 INFO L225 Difference]: With dead ends: 121 [2025-03-16 22:58:09,549 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 22:58:09,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-16 22:58:09,553 INFO L435 NwaCegarLoop]: 87 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, 87 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-16 22:58:09,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 22:58:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 22:58:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 22:58:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-16 22:58:09,583 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 121 [2025-03-16 22:58:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:09,583 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-16 22:58:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 22:58:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-16 22:58:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 22:58:09,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:09,585 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:09,592 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-16 22:58:09,786 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-16 22:58:09,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -161617259, now seen corresponding path program 1 times [2025-03-16 22:58:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867351527] [2025-03-16 22:58:09,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:09,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:09,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-16 22:58:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:10,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867351527] [2025-03-16 22:58:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867351527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:58:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280005873] [2025-03-16 22:58:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:10,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:58:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:10,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:58:10,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:58:10,159 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-16 22:58:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:10,296 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2025-03-16 22:58:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:58:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-03-16 22:58:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:10,300 INFO L225 Difference]: With dead ends: 179 [2025-03-16 22:58:10,300 INFO L226 Difference]: Without dead ends: 122 [2025-03-16 22:58:10,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:58:10,303 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 78 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:10,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 263 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:58:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-16 22:58:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2025-03-16 22:58:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 60 states have internal predecessors, (76), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 22:58:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-03-16 22:58:10,328 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 121 [2025-03-16 22:58:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:10,328 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-03-16 22:58:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-16 22:58:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-03-16 22:58:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 22:58:10,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:10,330 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:10,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:58:10,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 725886422, now seen corresponding path program 1 times [2025-03-16 22:58:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476250546] [2025-03-16 22:58:10,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:10,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:10,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:10,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:10,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:58:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099178953] [2025-03-16 22:58:10,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:10,442 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-16 22:58:10,444 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-16 22:58:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:10,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:10,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:10,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:58:10,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:58:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:58:10,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:58:10,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:10,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:58:10,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:58:10,626 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:58:10,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:58:10,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:58:10,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 22:58:10,831 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 22:58:10,875 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:58:10,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:58:10 BoogieIcfgContainer [2025-03-16 22:58:10,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:58:10,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:58:10,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:58:10,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:58:10,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:09" (3/4) ... [2025-03-16 22:58:10,879 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:58:10,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:58:10,880 INFO L158 Benchmark]: Toolchain (without parser) took 2507.66ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 81.9MB in the end (delta: 22.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-16 22:58:10,880 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:10,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.76ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:58:10,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:10,881 INFO L158 Benchmark]: Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:10,881 INFO L158 Benchmark]: IcfgBuilder took 376.68ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 64.7MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:58:10,881 INFO L158 Benchmark]: TraceAbstraction took 1835.45ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 82.8MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:10,881 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.9MB in the end (delta: 904.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:10,882 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.31ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.76ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.68ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 64.7MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1835.45ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 82.8MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.9MB in the end (delta: 904.0kB). 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 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L79] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L80] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L80] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L82] var_1_4 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L83] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L84] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L84] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L86] var_1_6 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L87] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L88] var_1_7 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L89] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L91] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L95] var_1_11 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L96] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L97] var_1_12 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L98] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L99] var_1_20 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L100] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L101] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L101] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L102] var_1_21 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L103] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L104] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L104] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=3, var_1_9=164/5] [L105] var_1_23 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L106] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L107] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L107] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_9=164/5] [L120] RET updateVariables() [L121] CALL step() [L43] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L44] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L48] COND TRUE var_1_10 || var_1_20 [L49] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L51] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L56] COND FALSE !(var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) [L59] var_1_1 = (var_1_6 - (var_1_8 + var_1_7)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L61] COND TRUE ! var_1_10 [L62] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L66] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L71] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L74] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L112-L113] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=0, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 118 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 196 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 32 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-16 22:58:10,895 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_codestructure_dependencies_file-62.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 b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:58:12,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:58:12,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:58:12,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:58:12,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:58:12,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:58:12,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:58:12,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:58:12,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:58:12,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:58:12,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:58:12,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:58:12,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:58:12,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:58:12,825 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:58:12,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:58:12,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:58:12,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:58:12,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:12,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:58:12,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:58:12,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:58:12,828 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 -> b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b [2025-03-16 22:58:13,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:58:13,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:58:13,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:58:13,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:58:13,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:58:13,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:14,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91514837/2fa1dd7ba4ad4072a62ffbc07f4d7f7b/FLAG3774613de [2025-03-16 22:58:14,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:58:14,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:14,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91514837/2fa1dd7ba4ad4072a62ffbc07f4d7f7b/FLAG3774613de [2025-03-16 22:58:14,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91514837/2fa1dd7ba4ad4072a62ffbc07f4d7f7b [2025-03-16 22:58:14,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:58:14,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:58:14,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:14,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:58:14,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:58:14,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:14" (1/1) ... [2025-03-16 22:58:14,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ba5ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:14, skipping insertion in model container [2025-03-16 22:58:14,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:14" (1/1) ... [2025-03-16 22:58:14,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:58:14,947 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_codestructure_dependencies_file-62.i[919,932] [2025-03-16 22:58:14,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:14,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:58:15,002 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_codestructure_dependencies_file-62.i[919,932] [2025-03-16 22:58:15,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:15,036 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:58:15,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15 WrapperNode [2025-03-16 22:58:15,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:15,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:15,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:58:15,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:58:15,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,082 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-16 22:58:15,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:15,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:58:15,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:58:15,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:58:15,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,109 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-16 22:58:15,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:58:15,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:58:15,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:58:15,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:58:15,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (1/1) ... [2025-03-16 22:58:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:15,169 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-16 22:58:15,173 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-16 22:58:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:58:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:58:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:58:15,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:58:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:58:15,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:58:15,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:58:15,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:58:46,115 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:58:46,115 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:58:46,123 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:58:46,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:58:46,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:46 BoogieIcfgContainer [2025-03-16 22:58:46,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:58:46,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:58:46,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:58:46,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:58:46,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:58:14" (1/3) ... [2025-03-16 22:58:46,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7706244f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:46, skipping insertion in model container [2025-03-16 22:58:46,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:15" (2/3) ... [2025-03-16 22:58:46,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7706244f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:46, skipping insertion in model container [2025-03-16 22:58:46,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:46" (3/3) ... [2025-03-16 22:58:46,134 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-62.i [2025-03-16 22:58:46,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:58:46,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-62.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:58:46,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:58:46,189 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;@4aa871d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:58:46,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:58:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 22:58:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 22:58:46,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:46,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:46,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -254668540, now seen corresponding path program 1 times [2025-03-16 22:58:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:58:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627400058] [2025-03-16 22:58:46,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:46,218 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-16 22:58:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:58:46,222 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-16 22:58:46,225 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-16 22:58:46,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 22:58:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 22:58:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:47,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:47,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:58:47,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-16 22:58:47,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:47,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:58:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627400058] [2025-03-16 22:58:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627400058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:47,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:58:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584407600] [2025-03-16 22:58:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:47,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:58:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:58:47,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:58:47,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:47,585 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 22:58:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:47,602 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2025-03-16 22:58:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:58:47,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-03-16 22:58:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:47,607 INFO L225 Difference]: With dead ends: 101 [2025-03-16 22:58:47,608 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 22:58:47,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-16 22:58:47,614 INFO L435 NwaCegarLoop]: 77 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, 77 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-16 22:58:47,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 22:58:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 22:58:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 22:58:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2025-03-16 22:58:47,650 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 118 [2025-03-16 22:58:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:47,651 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2025-03-16 22:58:47,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 22:58:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2025-03-16 22:58:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 22:58:47,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:47,654 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:47,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:58:47,855 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-16 22:58:47,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 920508897, now seen corresponding path program 1 times [2025-03-16 22:58:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:58:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240872165] [2025-03-16 22:58:47,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:47,857 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-16 22:58:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:58:47,860 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-16 22:58:47,861 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-16 22:58:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 22:58:50,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 22:58:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:50,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 22:58:50,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:51,066 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)