./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.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_steplocals_file-76.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 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:24:24,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:24:24,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:24:24,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:24:24,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:24:24,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:24:24,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:24:24,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:24:24,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:24:24,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:24:24,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:24:24,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:24:24,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:24:24,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:24:24,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:24:24,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:24:24,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:24:24,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:24:24,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:24:24,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:24:24,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:24:24,853 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 -> 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 [2025-03-16 23:24:25,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:24:25,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:24:25,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:24:25,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:24:25,111 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:24:25,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:26,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd46e6f6/43107ab1367542a488acf804a697f185/FLAG2a2688e74 [2025-03-16 23:24:26,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:24:26,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:26,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd46e6f6/43107ab1367542a488acf804a697f185/FLAG2a2688e74 [2025-03-16 23:24:26,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd46e6f6/43107ab1367542a488acf804a697f185 [2025-03-16 23:24:26,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:24:26,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:24:26,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:24:26,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:24:26,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:24:26,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:24:26" (1/1) ... [2025-03-16 23:24:26,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:26, skipping insertion in model container [2025-03-16 23:24:26,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:24:26" (1/1) ... [2025-03-16 23:24:26,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:24:26,936 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_steplocals_file-76.i[917,930] [2025-03-16 23:24:26,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:24:27,003 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:24:27,012 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_steplocals_file-76.i[917,930] [2025-03-16 23:24:27,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:24:27,057 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:24:27,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27 WrapperNode [2025-03-16 23:24:27,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:24:27,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:24:27,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:24:27,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:24:27,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,100 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-16 23:24:27,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:24:27,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:24:27,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:24:27,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:24:27,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,126 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 23:24:27,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:24:27,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:24:27,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:24:27,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:24:27,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (1/1) ... [2025-03-16 23:24:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:24:27,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:24:27,170 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 23:24:27,172 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 23:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:24:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:24:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:24:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:24:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:24:27,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:24:27,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:24:27,508 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-16 23:24:27,537 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:24:27,538 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:24:27,559 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:24:27,560 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:24:27,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:24:27 BoogieIcfgContainer [2025-03-16 23:24:27,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:24:27,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:24:27,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:24:27,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:24:27,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:24:26" (1/3) ... [2025-03-16 23:24:27,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32327662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:24:27, skipping insertion in model container [2025-03-16 23:24:27,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:27" (2/3) ... [2025-03-16 23:24:27,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32327662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:24:27, skipping insertion in model container [2025-03-16 23:24:27,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:24:27" (3/3) ... [2025-03-16 23:24:27,570 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:27,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:24:27,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-76.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:24:27,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:24:27,637 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;@3283ffb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:24:27,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:24:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:24:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:24:27,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:24:27,650 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:24:27,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:24:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:24:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1603400566, now seen corresponding path program 1 times [2025-03-16 23:24:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:24:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614877730] [2025-03-16 23:24:27,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:24:27,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:24:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:24:27,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:24:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-16 23:24:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:24:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614877730] [2025-03-16 23:24:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614877730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:24:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675053879] [2025-03-16 23:24:27,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:24:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:24:27,881 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 23:24:27,882 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 23:24:27,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:24:27,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:24:27,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:27,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:24:27,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:24:28,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:24:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-16 23:24:28,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:24:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675053879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:24:28,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:24:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:24:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021154857] [2025-03-16 23:24:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:24:28,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:24:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:24:28,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:24:28,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:24:28,039 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:24:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:24:28,068 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2025-03-16 23:24:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:24:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-03-16 23:24:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:24:28,075 INFO L225 Difference]: With dead ends: 143 [2025-03-16 23:24:28,075 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 23:24:28,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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 23:24:28,082 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:24:28,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:24:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 23:24:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-16 23:24:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:24:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2025-03-16 23:24:28,120 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 146 [2025-03-16 23:24:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:24:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2025-03-16 23:24:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:24:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2025-03-16 23:24:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:24:28,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:24:28,125 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:24:28,132 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 23:24:28,326 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 23:24:28,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:24:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:24:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -792350195, now seen corresponding path program 1 times [2025-03-16 23:24:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:24:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182426126] [2025-03-16 23:24:28,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:24:28,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:24:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:24:28,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:28,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:24:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860809661] [2025-03-16 23:24:28,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:28,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:24:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:24:28,510 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 23:24:28,511 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 23:24:28,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:24:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:24:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:28,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:24:28,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:24:28,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:24:28,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:24:28,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:28,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:24:28,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:24:28,720 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:24:28,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:24:28,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:24:28,926 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,SelfDestructingSolverStorable1 [2025-03-16 23:24:28,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-16 23:24:29,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:24:29,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:24:29 BoogieIcfgContainer [2025-03-16 23:24:29,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:24:29,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:24:29,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:24:29,003 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:24:29,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:24:27" (3/4) ... [2025-03-16 23:24:29,010 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:24:29,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:24:29,011 INFO L158 Benchmark]: Toolchain (without parser) took 2200.39ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 93.1MB in the end (delta: 40.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2025-03-16 23:24:29,011 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:24:29,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.39ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 119.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:24:29,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:24:29,012 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:24:29,012 INFO L158 Benchmark]: IcfgBuilder took 423.00ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 94.0MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:24:29,012 INFO L158 Benchmark]: TraceAbstraction took 1438.99ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 94.1MB in the end (delta: -985.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:24:29,013 INFO L158 Benchmark]: Witness Printer took 7.46ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 93.1MB in the end (delta: 995.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:24:29,014 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.49ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.39ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 119.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 423.00ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 94.0MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1438.99ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 94.1MB in the end (delta: -985.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.46ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 93.1MB in the end (delta: 995.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed char var_1_9 = -16; [L31] signed long int var_1_10 = 1; [L32] signed long int var_1_11 = 4; [L33] signed long int var_1_12 = 0; [L34] signed long int var_1_13 = -16; [L35] unsigned short int var_1_14 = 10000; [L36] unsigned short int var_1_15 = 5; [L37] unsigned short int var_1_16 = 5; [L38] unsigned short int var_1_17 = 4; [L39] unsigned char var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 8; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L95] var_1_4 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L96] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L97] var_1_5 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L98] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L99] var_1_7 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L100] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L101] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L101] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L102] var_1_9 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_9 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L103] RET assume_abort_if_not(var_1_9 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L104] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L104] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L105] var_1_10 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L106] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L107] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L107] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L108] var_1_12 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_12 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L109] RET assume_abort_if_not(var_1_12 >= -1073741823) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L110] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L110] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L111] var_1_13 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_13 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L112] RET assume_abort_if_not(var_1_13 >= -1073741823) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L113] CALL assume_abort_if_not(var_1_13 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L113] RET assume_abort_if_not(var_1_13 <= 1073741823) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L114] var_1_15 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L116] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L116] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L117] var_1_16 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L118] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L119] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L119] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L120] var_1_19 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L121] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L122] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L122] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L123] var_1_20 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L124] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L125] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L125] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE ! var_1_2 [L46] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L50] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L55] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, stepLocal_0=-4095, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L56] COND FALSE !((var_1_6 * var_1_9) >= stepLocal_0) VAL [isInitial=1, var_1_10=-4095, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L61] COND TRUE var_1_4 <= var_1_1 [L62] var_1_11 = (var_1_9 + -128) VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L66] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L73] COND FALSE !(\read(var_1_2)) [L82] var_1_17 = var_1_16 VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L84] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, stepLocal_1=0, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L85] EXPR var_1_11 | var_1_6 VAL [isInitial=1, stepLocal_1=0, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L85] COND TRUE (var_1_14 + (var_1_11 | var_1_6)) > stepLocal_1 [L86] var_1_18 = (128 - (var_1_19 + var_1_20)) VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_6 * var_1_9) >= var_1_10) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= var_1_1) ? (var_1_11 == ((signed long int) (var_1_9 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (var_1_9)) ? (-256) : (var_1_9))) + ((((var_1_12) < (((((var_1_13) > (256)) ? (var_1_13) : (256))))) ? (var_1_12) : (((((var_1_13) > (256)) ? (var_1_13) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_15)) : (var_1_14 == ((unsigned short int) var_1_16))) : 1)) && (var_1_2 ? ((var_1_1 == var_1_5) ? (((128 * ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10)))) > 1) ? (var_1_17 == ((unsigned short int) var_1_16)) : 1) : (var_1_17 == ((unsigned short int) var_1_15))) : (var_1_17 == ((unsigned short int) var_1_16)))) && (((var_1_14 + (var_1_11 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L130-L131] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_6 * var_1_9) >= var_1_10) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= var_1_1) ? (var_1_11 == ((signed long int) (var_1_9 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (var_1_9)) ? (-256) : (var_1_9))) + ((((var_1_12) < (((((var_1_13) > (256)) ? (var_1_13) : (256))))) ? (var_1_12) : (((((var_1_13) > (256)) ? (var_1_13) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_15)) : (var_1_14 == ((unsigned short int) var_1_16))) : 1)) && (var_1_2 ? ((var_1_1 == var_1_5) ? (((128 * ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10)))) > 1) ? (var_1_17 == ((unsigned short int) var_1_16)) : 1) : (var_1_17 == ((unsigned short int) var_1_15))) : (var_1_17 == ((unsigned short int) var_1_16)))) && (((var_1_14 + (var_1_11 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L19] reach_error() VAL [isInitial=1, var_1_10=-4095, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 137 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1980/2024 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 23:24:29,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_steplocals_file-76.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 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:24:31,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:24:31,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:24:31,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:24:31,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:24:31,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:24:31,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:24:31,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:24:31,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:24:31,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:24:31,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:24:31,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:24:31,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:24:31,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:24:31,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:24:31,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:24:31,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:24:31,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:24:31,119 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 -> 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 [2025-03-16 23:24:31,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:24:31,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:24:31,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:24:31,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:24:31,413 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:24:31,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:32,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af8e28f3/205798b0cbbe46f5826a78e81379a6d1/FLAG8130e8a4f [2025-03-16 23:24:32,743 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:24:32,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:32,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af8e28f3/205798b0cbbe46f5826a78e81379a6d1/FLAG8130e8a4f [2025-03-16 23:24:32,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af8e28f3/205798b0cbbe46f5826a78e81379a6d1 [2025-03-16 23:24:32,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:24:32,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:24:32,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:24:32,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:24:32,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:24:32,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:24:32" (1/1) ... [2025-03-16 23:24:32,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e506dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:32, skipping insertion in model container [2025-03-16 23:24:32,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:24:32" (1/1) ... [2025-03-16 23:24:32,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:24:32,901 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_steplocals_file-76.i[917,930] [2025-03-16 23:24:32,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:24:32,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:24:32,982 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_steplocals_file-76.i[917,930] [2025-03-16 23:24:33,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:24:33,030 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:24:33,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33 WrapperNode [2025-03-16 23:24:33,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:24:33,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:24:33,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:24:33,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:24:33,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,073 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-16 23:24:33,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:24:33,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:24:33,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:24:33,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:24:33,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,103 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 23:24:33,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:24:33,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:24:33,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:24:33,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:24:33,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (1/1) ... [2025-03-16 23:24:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:24:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:24:33,156 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 23:24:33,160 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 23:24:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:24:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:24:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:24:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:24:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:24:33,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:24:33,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:24:33,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:24:46,525 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:24:46,526 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:24:46,535 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:24:46,535 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:24:46,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:24:46 BoogieIcfgContainer [2025-03-16 23:24:46,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:24:46,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:24:46,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:24:46,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:24:46,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:24:32" (1/3) ... [2025-03-16 23:24:46,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a275c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:24:46, skipping insertion in model container [2025-03-16 23:24:46,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:24:33" (2/3) ... [2025-03-16 23:24:46,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a275c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:24:46, skipping insertion in model container [2025-03-16 23:24:46,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:24:46" (3/3) ... [2025-03-16 23:24:46,544 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-76.i [2025-03-16 23:24:46,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:24:46,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-76.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:24:46,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:24:46,610 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;@16830993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:24:46,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:24:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:24:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 23:24:46,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:24:46,621 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:24:46,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:24:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:24:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -662110546, now seen corresponding path program 1 times [2025-03-16 23:24:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:24:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908265885] [2025-03-16 23:24:46,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:46,632 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 23:24:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:24:46,634 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 23:24:46,635 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 23:24:46,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:24:47,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:24:47,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:47,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:24:47,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:24:47,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:24:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-03-16 23:24:47,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:24:47,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:24:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908265885] [2025-03-16 23:24:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908265885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:24:47,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:24:47,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:24:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026372564] [2025-03-16 23:24:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:24:47,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:24:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:24:47,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:24:47,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:24:47,438 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:24:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:24:47,456 INFO L93 Difference]: Finished difference Result 123 states and 219 transitions. [2025-03-16 23:24:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:24:47,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2025-03-16 23:24:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:24:47,461 INFO L225 Difference]: With dead ends: 123 [2025-03-16 23:24:47,461 INFO L226 Difference]: Without dead ends: 61 [2025-03-16 23:24:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:24:47,465 INFO L435 NwaCegarLoop]: 95 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, 95 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 23:24:47,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:24:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-16 23:24:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-16 23:24:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:24:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2025-03-16 23:24:47,514 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 95 transitions. Word has length 142 [2025-03-16 23:24:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:24:47,514 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 95 transitions. [2025-03-16 23:24:47,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:24:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 95 transitions. [2025-03-16 23:24:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 23:24:47,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:24:47,517 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:24:47,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:24:47,718 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 23:24:47,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:24:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:24:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1136796239, now seen corresponding path program 1 times [2025-03-16 23:24:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:24:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946986345] [2025-03-16 23:24:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:47,719 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 23:24:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:24:47,722 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 23:24:47,722 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 23:24:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:24:48,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:24:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:24:48,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:24:48,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:24:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-16 23:24:48,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:24:48,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:24:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946986345] [2025-03-16 23:24:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946986345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:24:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:24:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:24:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581594420] [2025-03-16 23:24:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:24:48,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:24:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:24:48,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:24:48,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:24:48,618 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:24:53,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:24:57,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:24:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:24:57,185 INFO L93 Difference]: Finished difference Result 138 states and 215 transitions. [2025-03-16 23:24:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:24:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-03-16 23:24:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:24:57,190 INFO L225 Difference]: With dead ends: 138 [2025-03-16 23:24:57,190 INFO L226 Difference]: Without dead ends: 78 [2025-03-16 23:24:57,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:24:57,191 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:24:57,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-16 23:24:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-16 23:24:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-03-16 23:24:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:24:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2025-03-16 23:24:57,202 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 142 [2025-03-16 23:24:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:24:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2025-03-16 23:24:57,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:24:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2025-03-16 23:24:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 23:24:57,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:24:57,204 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:24:57,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:24:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:24:57,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:24:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:24:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1265878958, now seen corresponding path program 1 times [2025-03-16 23:24:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:24:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144142296] [2025-03-16 23:24:57,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:24:57,406 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 23:24:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:24:57,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:24:57,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:24:57,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:24:58,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:24:58,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:24:58,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:24:58,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 23:24:58,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:25:07,174 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:15,484 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:21,780 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:29,418 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:37,679 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:49,255 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:25:56,563 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:26:04,313 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:26:12,570 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)