./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:27:14,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:27:14,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:27:14,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:27:14,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:27:14,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:27:14,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:27:14,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:27:14,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:27:14,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:27:14,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:27:14,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:27:14,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:27:14,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:27:14,126 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:27:14,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:27:14,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:27:14,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:27:14,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:14,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:27:14,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:27:14,129 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2025-03-17 03:27:14,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:27:14,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:27:14,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:27:14,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:27:14,418 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:27:14,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:15,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599a08d47/2c434894fd3b4177bd63102155eb5f7f/FLAG128436c04 [2025-03-17 03:27:16,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:27:16,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:16,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599a08d47/2c434894fd3b4177bd63102155eb5f7f/FLAG128436c04 [2025-03-17 03:27:16,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599a08d47/2c434894fd3b4177bd63102155eb5f7f [2025-03-17 03:27:16,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:27:16,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:27:16,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:16,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:27:16,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:27:16,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16, skipping insertion in model container [2025-03-17 03:27:16,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:27:16,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2025-03-17 03:27:16,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:16,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:27:16,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2025-03-17 03:27:16,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:16,554 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:27:16,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16 WrapperNode [2025-03-17 03:27:16,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:16,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:16,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:27:16,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:27:16,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,610 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-17 03:27:16,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:16,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:27:16,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:27:16,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:27:16,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,641 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-17 03:27:16,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:27:16,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:27:16,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:27:16,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:27:16,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (1/1) ... [2025-03-17 03:27:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:16,693 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-17 03:27:16,698 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-17 03:27:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:27:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:27:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:27:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:27:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:27:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:27:16,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:27:16,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:27:17,014 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short13#1; [2025-03-17 03:27:17,038 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 03:27:17,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:27:17,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:27:17,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:27:17,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:17 BoogieIcfgContainer [2025-03-17 03:27:17,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:27:17,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:27:17,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:27:17,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:27:17,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:16" (1/3) ... [2025-03-17 03:27:17,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd0168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:17, skipping insertion in model container [2025-03-17 03:27:17,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:16" (2/3) ... [2025-03-17 03:27:17,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd0168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:17, skipping insertion in model container [2025-03-17 03:27:17,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:17" (3/3) ... [2025-03-17 03:27:17,065 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:17,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:27:17,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:27:17,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:27:17,137 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;@4dd9eda8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:27:17,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:27:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 03:27:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 03:27:17,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:17,147 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:17,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash -318185546, now seen corresponding path program 1 times [2025-03-17 03:27:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:17,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056990191] [2025-03-17 03:27:17,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 03:27:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 03:27:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 03:27:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056990191] [2025-03-17 03:27:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056990191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286191650] [2025-03-17 03:27:17,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:17,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:17,400 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-17 03:27:17,401 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-17 03:27:17,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 03:27:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 03:27:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:17,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:27:17,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 03:27:17,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:27:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286191650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:27:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:27:17,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097622560] [2025-03-17 03:27:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:17,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:27:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:17,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:27:17,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:27:17,557 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 03:27:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:17,581 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2025-03-17 03:27:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:27:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2025-03-17 03:27:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:17,587 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:27:17,587 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 03:27:17,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-17 03:27:17,592 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:17,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:27:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 03:27:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 03:27:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 03:27:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 03:27:17,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 73 [2025-03-17 03:27:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 03:27:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 03:27:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 03:27:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 03:27:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:17,631 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:17,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:27:17,835 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-17 03:27:17,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:17,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -895843147, now seen corresponding path program 1 times [2025-03-17 03:27:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228833168] [2025-03-17 03:27:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:17,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 03:27:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 03:27:17,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228833168] [2025-03-17 03:27:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228833168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:27:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242063339] [2025-03-17 03:27:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:18,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:27:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:27:18,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:27:18,619 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:18,819 INFO L93 Difference]: Finished difference Result 145 states and 210 transitions. [2025-03-17 03:27:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:27:18,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-03-17 03:27:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:18,823 INFO L225 Difference]: With dead ends: 145 [2025-03-17 03:27:18,824 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 03:27:18,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:27:18,826 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 79 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:18,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:27:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 03:27:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2025-03-17 03:27:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-03-17 03:27:18,847 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 73 [2025-03-17 03:27:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-03-17 03:27:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-03-17 03:27:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 03:27:18,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:18,849 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:27:18,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 846967188, now seen corresponding path program 1 times [2025-03-17 03:27:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-17 03:27:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:18,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 03:27:18,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 03:27:18,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:18,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-17 03:27:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666110177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:27:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752789115] [2025-03-17 03:27:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:19,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:27:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:19,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:27:19,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:27:19,252 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:19,463 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2025-03-17 03:27:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:27:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-03-17 03:27:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:19,466 INFO L225 Difference]: With dead ends: 180 [2025-03-17 03:27:19,466 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 03:27:19,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:27:19,467 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:19,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 529 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:27:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 03:27:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2025-03-17 03:27:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.360655737704918) internal successors, (83), 62 states have internal predecessors, (83), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-17 03:27:19,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 73 [2025-03-17 03:27:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-17 03:27:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-17 03:27:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 03:27:19,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:19,486 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:19,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:27:19,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 748787064, now seen corresponding path program 1 times [2025-03-17 03:27:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-03-17 03:27:19,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:19,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 03:27:19,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 03:27:19,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:19,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-03-17 03:27:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871031350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:20,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:20,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:27:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409204741] [2025-03-17 03:27:20,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:20,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:27:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:20,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:27:20,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:27:20,080 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:20,272 INFO L93 Difference]: Finished difference Result 198 states and 282 transitions. [2025-03-17 03:27:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:27:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-17 03:27:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:20,274 INFO L225 Difference]: With dead ends: 198 [2025-03-17 03:27:20,274 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:27:20,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:27:20,275 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 92 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:20,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 326 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:27:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:27:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2025-03-17 03:27:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.360655737704918) internal successors, (83), 62 states have internal predecessors, (83), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-17 03:27:20,295 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 74 [2025-03-17 03:27:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:20,296 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-17 03:27:20,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-17 03:27:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 03:27:20,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:20,298 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:20,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:27:20,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1636290745, now seen corresponding path program 1 times [2025-03-17 03:27:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-17 03:27:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:20,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 03:27:20,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 03:27:20,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-17 03:27:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511784394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:20,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:20,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:27:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372854327] [2025-03-17 03:27:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:20,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:27:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:20,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:27:20,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:27:20,901 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:21,231 INFO L93 Difference]: Finished difference Result 198 states and 281 transitions. [2025-03-17 03:27:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:27:21,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-17 03:27:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:21,234 INFO L225 Difference]: With dead ends: 198 [2025-03-17 03:27:21,234 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:27:21,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:27:21,235 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 59 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 599 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:27:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:27:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2025-03-17 03:27:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 60 states have internal predecessors, (80), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2025-03-17 03:27:21,248 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 74 [2025-03-17 03:27:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:21,248 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2025-03-17 03:27:21,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2025-03-17 03:27:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 03:27:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:21,249 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:21,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:27:21,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1058667399, now seen corresponding path program 1 times [2025-03-17 03:27:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-03-17 03:27:21,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:21,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 03:27:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 03:27:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:21,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:21,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-03-17 03:27:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312495224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:27:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960272278] [2025-03-17 03:27:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:21,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:27:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:21,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:27:21,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:27:21,577 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:21,818 INFO L93 Difference]: Finished difference Result 194 states and 276 transitions. [2025-03-17 03:27:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:27:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-17 03:27:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:21,821 INFO L225 Difference]: With dead ends: 194 [2025-03-17 03:27:21,821 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 03:27:21,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:27:21,822 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:21,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 518 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:27:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 03:27:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2025-03-17 03:27:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 60 states have internal predecessors, (80), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2025-03-17 03:27:21,833 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 74 [2025-03-17 03:27:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2025-03-17 03:27:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2025-03-17 03:27:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 03:27:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:21,835 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:27:21,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -171163718, now seen corresponding path program 1 times [2025-03-17 03:27:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-03-17 03:27:21,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:21,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 03:27:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 03:27:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 03:27:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:22,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-03-17 03:27:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163986276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:22,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:22,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:27:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34690175] [2025-03-17 03:27:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:27:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:22,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:27:22,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:27:22,065 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:22,274 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2025-03-17 03:27:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:27:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-17 03:27:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:22,276 INFO L225 Difference]: With dead ends: 194 [2025-03-17 03:27:22,276 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 03:27:22,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:27:22,277 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 60 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:22,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 660 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:27:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 03:27:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 79. [2025-03-17 03:27:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:27:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2025-03-17 03:27:22,295 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 74 [2025-03-17 03:27:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:22,295 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2025-03-17 03:27:22,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2025-03-17 03:27:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 03:27:22,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:22,297 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:22,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:27:22,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:22,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1556762899, now seen corresponding path program 1 times [2025-03-17 03:27:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865387859] [2025-03-17 03:27:22,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:22,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 03:27:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 03:27:22,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:22,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:27:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847586765] [2025-03-17 03:27:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:22,325 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-17 03:27:22,327 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-17 03:27:22,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 03:27:22,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 03:27:22,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:22,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 03:27:22,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 51 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-17 03:27:22,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:27:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865387859] [2025-03-17 03:27:22,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:27:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847586765] [2025-03-17 03:27:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847586765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:22,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:27:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-17 03:27:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591471679] [2025-03-17 03:27:22,924 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 03:27:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:27:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:27:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:27:22,925 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 03:27:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:23,236 INFO L93 Difference]: Finished difference Result 217 states and 309 transitions. [2025-03-17 03:27:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:27:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2025-03-17 03:27:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:23,239 INFO L225 Difference]: With dead ends: 217 [2025-03-17 03:27:23,239 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 03:27:23,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:27:23,240 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:23,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 267 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:27:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 03:27:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2025-03-17 03:27:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.308641975308642) internal successors, (106), 82 states have internal predecessors, (106), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 03:27:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2025-03-17 03:27:23,264 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 75 [2025-03-17 03:27:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2025-03-17 03:27:23,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 03:27:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2025-03-17 03:27:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 03:27:23,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:23,265 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:23,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:27:23,470 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,SelfDestructingSolverStorable7 [2025-03-17 03:27:23,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1360249394, now seen corresponding path program 1 times [2025-03-17 03:27:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-03-17 03:27:23,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 03:27:23,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 03:27:23,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:23,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:27:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121043263] [2025-03-17 03:27:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:23,518 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-17 03:27:23,521 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-17 03:27:23,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 03:27:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 03:27:23,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:23,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:27:23,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:27:23,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 03:27:23,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 03:27:23,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:23,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:27:23,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:27:23,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:27:23,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:27:23,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:27:23,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:23,909 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:27:23,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:27:23,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:27:23 BoogieIcfgContainer [2025-03-17 03:27:23,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:27:23,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:27:23,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:27:23,955 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:27:23,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:17" (3/4) ... [2025-03-17 03:27:23,957 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:27:23,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:27:23,958 INFO L158 Benchmark]: Toolchain (without parser) took 7641.38ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.4MB in the beginning and 197.6MB in the end (delta: -92.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-03-17 03:27:23,958 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:23,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.33ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:27:23,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.57ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:23,958 INFO L158 Benchmark]: Boogie Preprocessor took 51.83ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:23,959 INFO L158 Benchmark]: IcfgBuilder took 391.25ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 67.6MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:27:23,959 INFO L158 Benchmark]: TraceAbstraction took 6895.68ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.6MB in the beginning and 197.7MB in the end (delta: -130.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-17 03:27:23,959 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 302.0MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:23,960 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.33ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.57ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.83ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 391.25ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 67.6MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6895.68ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.6MB in the beginning and 197.7MB in the end (delta: -130.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 302.0MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 92.3kB). 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 someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 16; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_11 = 1000000.5; [L31] double var_1_12 = 1.25; [L32] signed long int last_1_var_1_1 = 200; [L33] unsigned char last_1_var_1_8 = 16; [L34] unsigned short int last_1_var_1_10 = 4; [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L94] COND TRUE k_loop < 1 [L95] CALL updateLastVariables() [L82] last_1_var_1_1 = var_1_1 [L83] last_1_var_1_8 = var_1_8 [L84] last_1_var_1_10 = var_1_10 [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L66] var_1_3 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L74] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L74] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L77] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L77] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L96] RET updateVariables() [L97] CALL step() [L38] signed long int stepLocal_2 = last_1_var_1_8; [L39] signed long int stepLocal_1 = var_1_3 * last_1_var_1_8; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_1=17179869152, stepLocal_2=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L40] COND TRUE stepLocal_1 >= last_1_var_1_1 [L41] var_1_10 = (2 + var_1_9) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=256, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L49] signed long int stepLocal_0 = last_1_var_1_10 / var_1_3; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_0=0, stepLocal_2=16, var_1_10=256, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L50] COND FALSE !(stepLocal_0 >= (500 - last_1_var_1_10)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=256, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_10) - var_1_8) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=256, var_1_11=2000001/2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L60] var_1_11 = var_1_12 [L97] RET step() [L98] CALL, EXPR property() [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=256, var_1_11=2, var_1_12=2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L87] EXPR ((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=256, var_1_11=2, var_1_12=2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=256, var_1_11=2, var_1_12=2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L87-L88] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))))) && (var_1_11 == ((double) var_1_12)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=256, var_1_11=2, var_1_12=2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=256, var_1_11=2, var_1_12=2, var_1_1=1073741550, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 86 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 3187 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2526 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1067 IncrementalHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 661 mSDtfsCounter, 1067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=8, InterpolantAutomatonStates: 51, 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, 8 MinimizatonAttempts, 192 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 654 ConstructedInterpolants, 1 QuantifiedInterpolants, 1504 SizeOfPredicates, 3 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 1909/1980 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-17 03:27:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.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 edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:27:26,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:27:26,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:27:26,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:27:26,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:27:26,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:27:26,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:27:26,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:27:26,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:27:26,270 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:27:26,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:27:26,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:27:26,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:27:26,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:27:26,271 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:27:26,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:27:26,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:27:26,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:27:26,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:26,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:27:26,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:27:26,274 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 -> edefa3ede03a09b2efca71b139c957891dc8e0f1d7994a4b8237a639ffd3afb0 [2025-03-17 03:27:26,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:27:26,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:27:26,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:27:26,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:27:26,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:27:26,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:27,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc038f93/e46dd4761e194b0c93a16e7fe5b37860/FLAG7da900339 [2025-03-17 03:27:28,088 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:27:28,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:28,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc038f93/e46dd4761e194b0c93a16e7fe5b37860/FLAG7da900339 [2025-03-17 03:27:28,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc038f93/e46dd4761e194b0c93a16e7fe5b37860 [2025-03-17 03:27:28,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:27:28,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:27:28,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:28,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:27:28,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:27:28,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325bb40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28, skipping insertion in model container [2025-03-17 03:27:28,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:27:28,576 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2025-03-17 03:27:28,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:28,618 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:27:28,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-31.i[915,928] [2025-03-17 03:27:28,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:28,653 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:27:28,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28 WrapperNode [2025-03-17 03:27:28,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:28,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:28,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:27:28,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:27:28,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,679 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-17 03:27:28,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:28,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:27:28,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:27:28,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:27:28,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,708 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-17 03:27:28,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:27:28,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:27:28,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:27:28,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:27:28,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (1/1) ... [2025-03-17 03:27:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:28,763 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-17 03:27:28,768 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-17 03:27:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:27:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:27:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:27:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:27:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:27:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:27:28,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:27:28,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:27:29,087 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:27:29,088 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:27:29,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:27:29,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:27:29,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:29 BoogieIcfgContainer [2025-03-17 03:27:29,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:27:29,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:27:29,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:27:29,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:27:29,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:28" (1/3) ... [2025-03-17 03:27:29,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c9fcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:29, skipping insertion in model container [2025-03-17 03:27:29,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:28" (2/3) ... [2025-03-17 03:27:29,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c9fcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:29, skipping insertion in model container [2025-03-17 03:27:29,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:29" (3/3) ... [2025-03-17 03:27:29,105 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i [2025-03-17 03:27:29,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:27:29,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-31.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:27:29,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:27:29,169 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;@3bd59034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:27:29,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:27:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 03:27:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 03:27:29,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:29,180 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:29,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -881100764, now seen corresponding path program 1 times [2025-03-17 03:27:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:27:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412745403] [2025-03-17 03:27:29,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:29,207 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-17 03:27:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:27:29,211 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-17 03:27:29,213 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-17 03:27:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 03:27:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 03:27:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:29,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:27:29,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 03:27:29,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:27:29,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:27:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412745403] [2025-03-17 03:27:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412745403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:27:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481355557] [2025-03-17 03:27:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:29,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:27:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:27:29,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:27:29,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:27:29,413 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:29,430 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2025-03-17 03:27:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:27:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2025-03-17 03:27:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:29,436 INFO L225 Difference]: With dead ends: 71 [2025-03-17 03:27:29,436 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 03:27:29,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-17 03:27:29,441 INFO L435 NwaCegarLoop]: 51 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, 51 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-17 03:27:29,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:27:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 03:27:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 03:27:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 03:27:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2025-03-17 03:27:29,477 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 70 [2025-03-17 03:27:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2025-03-17 03:27:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 03:27:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2025-03-17 03:27:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 03:27:29,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:29,480 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:29,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:27:29,683 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-17 03:27:29,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1909001093, now seen corresponding path program 1 times [2025-03-17 03:27:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:27:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101291571] [2025-03-17 03:27:29,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:29,686 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-17 03:27:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:27:29,689 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-17 03:27:29,703 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-17 03:27:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 03:27:29,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 03:27:29,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:29,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:27:29,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-17 03:27:31,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:27:35,071 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:27:35,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101291571] [2025-03-17 03:27:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101291571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [563455477] [2025-03-17 03:27:35,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:35,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:27:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:27:35,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:27:35,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-17 03:27:35,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 03:27:35,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 03:27:35,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:35,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:35,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:27:35,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-17 03:27:36,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:27:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [563455477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:37,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:27:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-03-17 03:27:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951054202] [2025-03-17 03:27:37,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:27:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:27:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:27:37,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:27:37,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:27:37,865 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 03:27:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:41,081 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2025-03-17 03:27:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 03:27:41,087 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 70 [2025-03-17 03:27:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:41,088 INFO L225 Difference]: With dead ends: 123 [2025-03-17 03:27:41,089 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 03:27:41,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 03:27:41,090 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:41,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 250 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 03:27:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 03:27:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2025-03-17 03:27:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:27:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2025-03-17 03:27:41,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 70 [2025-03-17 03:27:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:41,106 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2025-03-17 03:27:41,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 03:27:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2025-03-17 03:27:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 03:27:41,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:41,108 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:27:41,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-17 03:27:41,314 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-17 03:27:41,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 03:27:41,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1909924614, now seen corresponding path program 1 times [2025-03-17 03:27:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:27:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552982316] [2025-03-17 03:27:41,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:41,510 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-17 03:27:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:27:41,512 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 03:27:41,514 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 (5)] Waiting until timeout for monitored process [2025-03-17 03:27:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 03:27:41,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 03:27:41,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:41,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:41,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 03:27:41,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-17 03:27:50,720 INFO L312 TraceCheckSpWp]: Computing backward predicates...