./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/nla-digbench-scaling/divbin_valuebound20.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 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:59:21,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:59:21,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:59:21,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:59:21,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:59:21,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:59:21,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:59:21,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:59:21,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:59:21,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:59:21,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:59:21,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:59:21,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:59:21,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:59:21,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:59:21,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:59:21,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:59:21,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:59:21,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:59:21,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:59:21,090 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 -> 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 [2025-03-08 04:59:21,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:59:21,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:59:21,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:59:21,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:59:21,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:59:21,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2025-03-08 04:59:22,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a996c222/8c20a700e61349eea3991f1f6484c089/FLAGba1943095 [2025-03-08 04:59:22,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:59:22,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2025-03-08 04:59:22,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a996c222/8c20a700e61349eea3991f1f6484c089/FLAGba1943095 [2025-03-08 04:59:22,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a996c222/8c20a700e61349eea3991f1f6484c089 [2025-03-08 04:59:22,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:59:22,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:59:22,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:59:22,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:59:22,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:59:22,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:59:22" (1/1) ... [2025-03-08 04:59:22,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:22, skipping insertion in model container [2025-03-08 04:59:22,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:59:22" (1/1) ... [2025-03-08 04:59:22,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:59:23,093 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/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2025-03-08 04:59:23,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:59:23,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:59:23,121 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/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2025-03-08 04:59:23,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:59:23,138 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:59:23,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23 WrapperNode [2025-03-08 04:59:23,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:59:23,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:59:23,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:59:23,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:59:23,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,159 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-03-08 04:59:23,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:59:23,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:59:23,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:59:23,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:59:23,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,177 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-08 04:59:23,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:59:23,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:59:23,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:59:23,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:59:23,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (1/1) ... [2025-03-08 04:59:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:59:23,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:23,212 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-08 04:59:23,218 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-08 04:59:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:59:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 04:59:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 04:59:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:59:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:59:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:59:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:59:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:59:23,272 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:59:23,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:59:23,393 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 04:59:23,394 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:59:23,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:59:23,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:59:23,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:59:23 BoogieIcfgContainer [2025-03-08 04:59:23,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:59:23,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:59:23,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:59:23,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:59:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:59:22" (1/3) ... [2025-03-08 04:59:23,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5f18c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:59:23, skipping insertion in model container [2025-03-08 04:59:23,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:59:23" (2/3) ... [2025-03-08 04:59:23,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5f18c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:59:23, skipping insertion in model container [2025-03-08 04:59:23,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:59:23" (3/3) ... [2025-03-08 04:59:23,412 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_valuebound20.i [2025-03-08 04:59:23,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:59:23,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_valuebound20.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:59:23,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:59:23,471 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;@35620aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:59:23,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:59:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:59:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:59:23,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:23,481 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:23,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -162508135, now seen corresponding path program 1 times [2025-03-08 04:59:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:23,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347666352] [2025-03-08 04:59:23,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:23,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:59:23,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:59:23,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:23,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:59:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347666352] [2025-03-08 04:59:23,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347666352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:59:23,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456636025] [2025-03-08 04:59:23,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:23,589 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-08 04:59:23,591 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-08 04:59:23,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:59:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:59:23,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:23,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 04:59:23,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:59:23,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:59:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456636025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:59:23,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:59:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 04:59:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501360759] [2025-03-08 04:59:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:59:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:59:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:23,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:59:23,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:59:23,671 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:59:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:23,681 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2025-03-08 04:59:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:59:23,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-08 04:59:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:23,686 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:59:23,686 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 04:59:23,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-08 04:59:23,689 INFO L435 NwaCegarLoop]: 33 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, 33 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-08 04:59:23,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:59:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 04:59:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 04:59:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:59:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-08 04:59:23,712 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 29 [2025-03-08 04:59:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:23,712 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-08 04:59:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:59:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-08 04:59:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:59:23,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:23,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:23,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:59:23,916 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-08 04:59:23,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1105005704, now seen corresponding path program 1 times [2025-03-08 04:59:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-03-08 04:59:23,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:23,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:59:23,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:59:23,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:23,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:59:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929743360] [2025-03-08 04:59:23,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:23,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:23,964 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-08 04:59:23,964 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-08 04:59:23,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:59:24,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:59:24,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:24,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:24,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:59:24,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:59:24,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:59:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 04:59:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-03-08 04:59:24,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:59:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929743360] [2025-03-08 04:59:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929743360] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:59:24,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:59:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-03-08 04:59:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475720579] [2025-03-08 04:59:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:59:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:59:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:24,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:59:24,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:59:24,455 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:59:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:24,622 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-08 04:59:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:59:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2025-03-08 04:59:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:24,623 INFO L225 Difference]: With dead ends: 33 [2025-03-08 04:59:24,623 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:59:24,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:59:24,624 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:59:24,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:59:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:59:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 04:59:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:59:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-08 04:59:24,629 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2025-03-08 04:59:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-08 04:59:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:59:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-08 04:59:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 04:59:24,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:24,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:24,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:59:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 04:59:24,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 138852969, now seen corresponding path program 1 times [2025-03-08 04:59:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-08 04:59:24,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:24,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 04:59:24,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:59:24,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:24,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:59:24,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616198485] [2025-03-08 04:59:24,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:24,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:24,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:24,870 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-08 04:59:24,871 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-08 04:59:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 04:59:24,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:59:24,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:24,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:24,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:59:24,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:59:24,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:59:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 04:59:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-08 04:59:25,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:59:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616198485] [2025-03-08 04:59:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616198485] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:59:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:59:25,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2025-03-08 04:59:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926372335] [2025-03-08 04:59:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:59:25,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:59:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:25,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:59:25,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:59:25,072 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:59:29,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 04:59:32,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 04:59:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:32,284 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-08 04:59:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:59:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2025-03-08 04:59:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:32,285 INFO L225 Difference]: With dead ends: 39 [2025-03-08 04:59:32,285 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:59:32,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:59:32,285 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:59:32,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-03-08 04:59:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:59:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2025-03-08 04:59:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:59:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-08 04:59:32,294 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 30 [2025-03-08 04:59:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:32,294 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-08 04:59:32,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:59:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-08 04:59:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:59:32,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:32,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:32,303 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-08 04:59:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:32,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 960799810, now seen corresponding path program 1 times [2025-03-08 04:59:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603512431] [2025-03-08 04:59:32,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:59:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:59:32,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:32,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 04:59:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603512431] [2025-03-08 04:59:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603512431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:59:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:59:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:59:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271460885] [2025-03-08 04:59:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:59:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:59:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:32,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:59:32,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:59:32,885 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:59:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:32,906 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-03-08 04:59:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:59:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-08 04:59:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:32,907 INFO L225 Difference]: With dead ends: 42 [2025-03-08 04:59:32,907 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:59:32,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:59:32,908 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:59:32,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:59:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:59:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 04:59:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:59:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-08 04:59:32,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 36 [2025-03-08 04:59:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:32,915 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-08 04:59:32,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:59:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-08 04:59:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:59:32,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:32,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:59:32,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash -982426575, now seen corresponding path program 1 times [2025-03-08 04:59:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442410699] [2025-03-08 04:59:32,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:32,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:59:32,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:59:32,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:59:32,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090335747] [2025-03-08 04:59:32,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:59:32,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:32,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:59:32,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:59:32,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:59:33,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:59:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:59:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:33,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:59:33,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:59:33,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:59:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442410699] [2025-03-08 04:59:33,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:59:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090335747] [2025-03-08 04:59:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090335747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:59:33,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:59:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-08 04:59:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945397743] [2025-03-08 04:59:33,297 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 04:59:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:59:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:33,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:59:33,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:59:33,298 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:59:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:33,403 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-03-08 04:59:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:59:33,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-03-08 04:59:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:33,404 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:59:33,404 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 04:59:33,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:59:33,405 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:59:33,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:59:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 04:59:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-08 04:59:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 04:59:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 04:59:33,412 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2025-03-08 04:59:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:33,413 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 04:59:33,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:59:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 04:59:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 04:59:33,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:33,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:33,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:59:33,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:33,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:33,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1976915607, now seen corresponding path program 2 times [2025-03-08 04:59:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:33,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877938367] [2025-03-08 04:59:33,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:59:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:33,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 04:59:33,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 04:59:33,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:59:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 04:59:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:59:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877938367] [2025-03-08 04:59:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877938367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:59:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340143135] [2025-03-08 04:59:34,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:59:34,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:34,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:34,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:59:34,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:59:34,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 04:59:34,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 04:59:34,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:59:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:34,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 04:59:34,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 04:59:34,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:59:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 04:59:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340143135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:59:34,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:59:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 7] total 22 [2025-03-08 04:59:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853369891] [2025-03-08 04:59:34,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:59:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 04:59:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:59:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 04:59:34,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:59:34,774 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 10 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (16), 10 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-08 04:59:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:59:35,428 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-08 04:59:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:59:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 10 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (16), 10 states have call predecessors, (16), 9 states have call successors, (16) Word has length 44 [2025-03-08 04:59:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:59:35,431 INFO L225 Difference]: With dead ends: 67 [2025-03-08 04:59:35,431 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 04:59:35,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2025-03-08 04:59:35,434 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:59:35,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 154 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:59:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 04:59:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-03-08 04:59:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 04:59:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-08 04:59:35,445 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 44 [2025-03-08 04:59:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:59:35,446 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-08 04:59:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 10 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (16), 10 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-08 04:59:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-08 04:59:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 04:59:35,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:59:35,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:59:35,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:59:35,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:35,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:59:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:59:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2121006504, now seen corresponding path program 3 times [2025-03-08 04:59:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:59:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494210920] [2025-03-08 04:59:35,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:59:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:59:35,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-08 04:59:35,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 04:59:35,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 04:59:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:59:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735051398] [2025-03-08 04:59:35,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:59:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:59:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:59:35,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:59:35,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:59:35,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-08 04:59:36,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 45 statements. [2025-03-08 04:59:36,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:59:36,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:59:36,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 04:59:36,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:59:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:59:56,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:00:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:00:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:00:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494210920] [2025-03-08 05:00:09,022 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:00:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735051398] [2025-03-08 05:00:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735051398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:00:09,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:00:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2025-03-08 05:00:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555226915] [2025-03-08 05:00:09,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:00:09,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 05:00:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:00:09,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 05:00:09,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=444, Unknown=1, NotChecked=0, Total=552 [2025-03-08 05:00:09,024 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 8 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:00:26,888 WARN L286 SmtUtils]: Spent 13.65s on a formula simplification. DAG size of input: 67 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:00:39,130 WARN L286 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:00:51,572 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 66 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:00:55,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 05:01:06,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []