./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-50.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_fillercode_fillercodesize_normal_file-50.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 65d784e509aa66e0a038c137435477bb43d0453bd5e9e6ae35b5aa59154f6b94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:32:54,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:32:54,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:32:54,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:32:54,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:32:54,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:32:54,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:32:54,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:32:54,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:32:54,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:32:54,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:32:54,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:32:54,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:32:54,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:32:54,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:32:54,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:32:54,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:32:54,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:32:54,481 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 -> 65d784e509aa66e0a038c137435477bb43d0453bd5e9e6ae35b5aa59154f6b94 [2025-03-16 23:32:54,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:32:54,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:32:54,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:32:54,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:32:54,792 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:32:54,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:32:55,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affab3ce5/b05447eadf56412fb510ddd0274300cd/FLAGafbdd1f59 [2025-03-16 23:32:56,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:32:56,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:32:56,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affab3ce5/b05447eadf56412fb510ddd0274300cd/FLAGafbdd1f59 [2025-03-16 23:32:56,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affab3ce5/b05447eadf56412fb510ddd0274300cd [2025-03-16 23:32:56,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:32:56,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:32:56,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:32:56,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:32:56,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:32:56,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56, skipping insertion in model container [2025-03-16 23:32:56,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:32:56,574 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_fillercode_fillercodesize_normal_file-50.i[913,926] [2025-03-16 23:32:56,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:32:56,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:32:56,648 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_fillercode_fillercodesize_normal_file-50.i[913,926] [2025-03-16 23:32:56,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:32:56,699 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:32:56,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56 WrapperNode [2025-03-16 23:32:56,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:32:56,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:32:56,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:32:56,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:32:56,706 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:32:56" (1/1) ... [2025-03-16 23:32:56,715 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:32:56" (1/1) ... [2025-03-16 23:32:56,749 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-16 23:32:56,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:32:56,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:32:56,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:32:56,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:32:56,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,768 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:32:56,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:32:56,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:32:56,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:32:56,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:32:56,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (1/1) ... [2025-03-16 23:32:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:32:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:32:56,828 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:32:56,834 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:32:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:32:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:32:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:32:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:32:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:32:56,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:32:56,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:32:56,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:32:57,125 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:32:57,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:32:57,132 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:32:57,134 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:32:57,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:32:57 BoogieIcfgContainer [2025-03-16 23:32:57,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:32:57,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:32:57,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:32:57,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:32:57,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:32:56" (1/3) ... [2025-03-16 23:32:57,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6920794b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:32:57, skipping insertion in model container [2025-03-16 23:32:57,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:32:56" (2/3) ... [2025-03-16 23:32:57,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6920794b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:32:57, skipping insertion in model container [2025-03-16 23:32:57,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:32:57" (3/3) ... [2025-03-16 23:32:57,143 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:32:57,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:32:57,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-50.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:32:57,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:32:57,213 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;@1c8bcaba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:32:57,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:32:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:32:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:32:57,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:32:57,225 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:32:57,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:32:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:32:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1568096070, now seen corresponding path program 1 times [2025-03-16 23:32:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:32:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-16 23:32:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:32:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:32:57,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:32:57,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:57,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:32:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:32:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-16 23:32:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420835339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:32:57,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789955574] [2025-03-16 23:32:57,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:32:57,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:32:57,432 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:32:57,433 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:32:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:32:57,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:32:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:57,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:32:57,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:32:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:32:57,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:32:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789955574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:32:57,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:32:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:32:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116761758] [2025-03-16 23:32:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:32:57,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:32:57,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:32:57,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:32:57,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:32:57,593 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:32:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:32:57,614 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2025-03-16 23:32:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:32:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2025-03-16 23:32:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:32:57,620 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:32:57,620 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:32:57,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:32:57,624 INFO L435 NwaCegarLoop]: 81 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, 81 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:32:57,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:32:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:32:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:32:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:32:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-16 23:32:57,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 126 [2025-03-16 23:32:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:32:57,670 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-16 23:32:57,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:32:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-16 23:32:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:32:57,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:32:57,673 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:32:57,680 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:32:57,878 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:32:57,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:32:57,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:32:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash 941288100, now seen corresponding path program 1 times [2025-03-16 23:32:57,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:32:57,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-03-16 23:32:57,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:32:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:32:57,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:32:57,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 23:32:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:32:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-03-16 23:32:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877055067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:32:58,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:32:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:32:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135714428] [2025-03-16 23:32:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:32:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:32:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:32:58,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:32:58,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:32:58,163 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:32:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:32:58,290 INFO L93 Difference]: Finished difference Result 159 states and 239 transitions. [2025-03-16 23:32:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:32:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-16 23:32:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:32:58,293 INFO L225 Difference]: With dead ends: 159 [2025-03-16 23:32:58,293 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 23:32:58,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:32:58,294 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 74 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:32:58,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 180 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:32:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 23:32:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2025-03-16 23:32:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:32:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-16 23:32:58,310 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 126 [2025-03-16 23:32:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:32:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-16 23:32:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:32:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-16 23:32:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:32:58,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:32:58,315 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:32:58,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:32:58,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:32:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:32:58,316 INFO L85 PathProgramCache]: Analyzing trace with hash 969917251, now seen corresponding path program 1 times [2025-03-16 23:32:58,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:32:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381170583] [2025-03-16 23:32:58,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:32:58,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:32:58,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:32:58,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:58,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-16 23:32:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:32:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381170583] [2025-03-16 23:32:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381170583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:32:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409579384] [2025-03-16 23:32:59,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:59,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:32:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:32:59,150 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:32:59,151 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:32:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:32:59,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:32:59,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:59,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:59,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 23:32:59,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:32:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-16 23:32:59,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:33:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-16 23:33:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409579384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:33:00,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:33:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2025-03-16 23:33:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013640467] [2025-03-16 23:33:00,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:33:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 23:33:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:33:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 23:33:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-03-16 23:33:00,062 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (25), 6 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-16 23:33:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:33:01,318 INFO L93 Difference]: Finished difference Result 238 states and 333 transitions. [2025-03-16 23:33:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 23:33:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (25), 6 states have call predecessors, (25), 3 states have call successors, (25) Word has length 126 [2025-03-16 23:33:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:33:01,323 INFO L225 Difference]: With dead ends: 238 [2025-03-16 23:33:01,324 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 23:33:01,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=552, Invalid=1800, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 23:33:01,327 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 338 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:33:01,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 461 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:33:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 23:33:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 68. [2025-03-16 23:33:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:33:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-03-16 23:33:01,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 126 [2025-03-16 23:33:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:33:01,353 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-03-16 23:33:01,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (25), 6 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-16 23:33:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-03-16 23:33:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:33:01,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:33:01,358 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:33:01,364 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:33:01,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 23:33:01,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:33:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:33:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 744774595, now seen corresponding path program 1 times [2025-03-16 23:33:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:33:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-03-16 23:33:01,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:33:01,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:01,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:01,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:33:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 23:33:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:33:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-03-16 23:33:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327199220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:33:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:33:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:33:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218627424] [2025-03-16 23:33:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:33:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:33:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:33:01,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:33:01,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:33:01,709 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:33:01,803 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2025-03-16 23:33:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:33:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-16 23:33:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:33:01,807 INFO L225 Difference]: With dead ends: 135 [2025-03-16 23:33:01,809 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 23:33:01,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:33:01,810 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:33:01,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 107 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:33:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 23:33:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-16 23:33:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:33:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2025-03-16 23:33:01,824 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 126 [2025-03-16 23:33:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:33:01,824 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2025-03-16 23:33:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2025-03-16 23:33:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:33:01,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:33:01,828 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:33:01,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:33:01,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:33:01,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:33:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 773403746, now seen corresponding path program 1 times [2025-03-16 23:33:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:33:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432288339] [2025-03-16 23:33:01,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:33:01,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:01,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:33:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709366378] [2025-03-16 23:33:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:33:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:33:01,937 INFO L229 MonitoredProcess]: Starting monitored process 4 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:33:01,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:33:01,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:02,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:02,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:02,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:33:02,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:33:02,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:02,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:02,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:33:02,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:33:02,221 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:33:02,222 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:33:02,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 23:33:02,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:33:02,430 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:33:02,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:33:02,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:33:02 BoogieIcfgContainer [2025-03-16 23:33:02,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:33:02,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:33:02,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:33:02,512 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:33:02,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:32:57" (3/4) ... [2025-03-16 23:33:02,514 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:33:02,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:33:02,516 INFO L158 Benchmark]: Toolchain (without parser) took 6049.66ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 124.2MB in the beginning and 284.3MB in the end (delta: -160.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-16 23:33:02,516 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:33:02,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.47ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 110.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:33:02,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 106.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:33:02,517 INFO L158 Benchmark]: Boogie Preprocessor took 41.24ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 99.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:33:02,517 INFO L158 Benchmark]: IcfgBuilder took 339.24ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 77.7MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:33:02,517 INFO L158 Benchmark]: TraceAbstraction took 5373.97ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 77.1MB in the beginning and 284.4MB in the end (delta: -207.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:33:02,518 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 360.7MB. Free memory was 284.4MB in the beginning and 284.3MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:33:02,519 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.47ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 110.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 106.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.24ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 99.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 339.24ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 77.7MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5373.97ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 77.1MB in the beginning and 284.4MB in the end (delta: -207.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 360.7MB. Free memory was 284.4MB in the beginning and 284.3MB in the end (delta: 72.1kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryArithmeticFLOAToperation at line 46, overapproximation of someUnaryFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L86] var_1_7 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L87] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L89] var_1_8 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L90] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L92] var_1_14 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L94] var_1_15 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L95] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L96] var_1_16 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L97] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L98] var_1_18 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L99] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L101] var_1_21 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L102] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L104] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L104] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L105] var_1_23 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L108] var_1_24 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L111] var_1_26 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L114] var_1_27 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L115] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] RET updateVariables() [L130] CALL step() [L45] COND TRUE \read(var_1_8) [L46] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L48] COND TRUE \read(var_1_8) [L49] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L51] var_1_29 = var_1_27 [L52] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L53] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L56] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L58] var_1_17 = ((var_1_18 - 25) - var_1_25) [L59] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L61] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L65] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L66] COND FALSE !((~ var_1_29) > stepLocal_3) [L69] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L71] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L72] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L73] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L82] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 829 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 820 IncrementalHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 321 mSDtfsCounter, 820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 165 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 SizeOfPredicates, 5 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5270/5320 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:33:02,539 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_fillercode_fillercodesize_normal_file-50.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 65d784e509aa66e0a038c137435477bb43d0453bd5e9e6ae35b5aa59154f6b94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:33:04,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:33:04,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:33:04,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:33:04,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:33:04,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:33:04,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:33:04,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:33:04,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:33:04,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:33:04,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:33:04,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:33:04,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:33:04,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:33:04,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:33:04,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:33:04,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:33:04,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:33:04,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:33:04,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:33:04,500 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:33:04,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:33:04,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:33:04,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:33:04,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:33:04,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:33:04,501 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 -> 65d784e509aa66e0a038c137435477bb43d0453bd5e9e6ae35b5aa59154f6b94 [2025-03-16 23:33:04,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:33:04,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:33:04,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:33:04,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:33:04,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:33:04,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:33:05,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ffe613c9/5d0ea905b09347d1b73dbe68a7829238/FLAG97d7e9aa7 [2025-03-16 23:33:06,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:33:06,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:33:06,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ffe613c9/5d0ea905b09347d1b73dbe68a7829238/FLAG97d7e9aa7 [2025-03-16 23:33:06,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ffe613c9/5d0ea905b09347d1b73dbe68a7829238 [2025-03-16 23:33:06,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:33:06,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:33:06,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:33:06,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:33:06,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:33:06,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4127f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06, skipping insertion in model container [2025-03-16 23:33:06,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:33:06,254 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_fillercode_fillercodesize_normal_file-50.i[913,926] [2025-03-16 23:33:06,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:33:06,328 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:33:06,336 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_fillercode_fillercodesize_normal_file-50.i[913,926] [2025-03-16 23:33:06,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:33:06,386 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:33:06,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06 WrapperNode [2025-03-16 23:33:06,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:33:06,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:33:06,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:33:06,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:33:06,392 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:33:06" (1/1) ... [2025-03-16 23:33:06,404 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:33:06" (1/1) ... [2025-03-16 23:33:06,423 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-16 23:33:06,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:33:06,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:33:06,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:33:06,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:33:06,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,446 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:33:06,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:33:06,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:33:06,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:33:06,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:33:06,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (1/1) ... [2025-03-16 23:33:06,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:33:06,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:33:06,496 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:33:06,504 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:33:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:33:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:33:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:33:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:33:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:33:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:33:06,577 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:33:06,579 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:33:07,033 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:33:07,033 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:33:07,041 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:33:07,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:33:07,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:33:07 BoogieIcfgContainer [2025-03-16 23:33:07,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:33:07,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:33:07,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:33:07,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:33:07,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:33:06" (1/3) ... [2025-03-16 23:33:07,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b629344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:33:07, skipping insertion in model container [2025-03-16 23:33:07,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:33:06" (2/3) ... [2025-03-16 23:33:07,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b629344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:33:07, skipping insertion in model container [2025-03-16 23:33:07,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:33:07" (3/3) ... [2025-03-16 23:33:07,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-50.i [2025-03-16 23:33:07,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:33:07,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-50.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:33:07,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:33:07,120 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;@4ea610c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:33:07,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:33:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:33:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:33:07,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:33:07,133 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:33:07,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:33:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:33:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1568096070, now seen corresponding path program 1 times [2025-03-16 23:33:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:33:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824999234] [2025-03-16 23:33:07,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:07,145 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:33:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:33:07,147 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:33:07,148 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:33:07,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:07,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:07,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:07,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:33:07,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:33:07,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:33:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:33:07,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:33:07,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:33:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824999234] [2025-03-16 23:33:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824999234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:33:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:33:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:33:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419848348] [2025-03-16 23:33:07,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:33:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:33:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:33:07,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:33:07,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:33:07,483 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:33:07,500 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2025-03-16 23:33:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:33:07,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-16 23:33:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:33:07,506 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:33:07,506 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:33:07,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:33:07,510 INFO L435 NwaCegarLoop]: 81 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, 81 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:33:07,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:33:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:33:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:33:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:33:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-16 23:33:07,543 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 126 [2025-03-16 23:33:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:33:07,543 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-16 23:33:07,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-16 23:33:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:33:07,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:33:07,546 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:33:07,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:33:07,747 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:33:07,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:33:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:33:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 941288100, now seen corresponding path program 1 times [2025-03-16 23:33:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:33:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396558658] [2025-03-16 23:33:07,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:07,748 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:33:07,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:33:07,751 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:33:07,752 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:33:07,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:07,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:07,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:07,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:33:07,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:33:07,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:33:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-16 23:33:08,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:33:08,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:33:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396558658] [2025-03-16 23:33:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396558658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:33:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:33:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:33:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930904729] [2025-03-16 23:33:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:33:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:33:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:33:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:33:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:33:08,090 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:33:08,315 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2025-03-16 23:33:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:33:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-16 23:33:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:33:08,319 INFO L225 Difference]: With dead ends: 147 [2025-03-16 23:33:08,319 INFO L226 Difference]: Without dead ends: 94 [2025-03-16 23:33:08,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:33:08,320 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 75 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:33:08,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 334 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:33:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-16 23:33:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2025-03-16 23:33:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:33:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-03-16 23:33:08,333 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 126 [2025-03-16 23:33:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:33:08,336 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-03-16 23:33:08,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 23:33:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-03-16 23:33:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 23:33:08,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:33:08,339 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:33:08,347 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 (3)] Ended with exit code 0 [2025-03-16 23:33:08,539 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:33:08,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:33:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:33:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 969917251, now seen corresponding path program 1 times [2025-03-16 23:33:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:33:08,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514031650] [2025-03-16 23:33:08,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:33:08,541 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:33:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:33:08,544 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:33:08,549 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:33:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 23:33:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 23:33:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:33:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:33:08,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 23:33:08,761 INFO L279 TraceCheckSpWp]: Computing forward predicates...