./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_allDiff2_ground.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/array-examples/standard_allDiff2_ground.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 45c2395b28f523380bfcff26ce2efb02406d69c6cc122ac9297e3f35ef9c7306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:08:31,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:08:31,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:08:31,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:08:31,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:08:31,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:08:31,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:08:31,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:08:31,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:08:31,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:08:31,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:08:31,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:08:31,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:08:31,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:08:31,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:08:31,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:08:31,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:08:31,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:08:31,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:08:31,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:08:31,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:08:31,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:08:31,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:08:31,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:08:31,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:08:31,375 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 -> 45c2395b28f523380bfcff26ce2efb02406d69c6cc122ac9297e3f35ef9c7306 [2025-03-08 00:08:31,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:08:31,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:08:31,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:08:31,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:08:31,608 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:08:31,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_allDiff2_ground.i [2025-03-08 00:08:32,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049651096/1ba5b44d5ece44e29f4257f16a0fb213/FLAG2df34ba58 [2025-03-08 00:08:33,065 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:08:33,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_allDiff2_ground.i [2025-03-08 00:08:33,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049651096/1ba5b44d5ece44e29f4257f16a0fb213/FLAG2df34ba58 [2025-03-08 00:08:33,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049651096/1ba5b44d5ece44e29f4257f16a0fb213 [2025-03-08 00:08:33,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:08:33,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:08:33,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:08:33,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:08:33,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:08:33,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e8df04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33, skipping insertion in model container [2025-03-08 00:08:33,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:08:33,239 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/array-examples/standard_allDiff2_ground.i[817,830] [2025-03-08 00:08:33,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:08:33,260 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:08:33,267 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/array-examples/standard_allDiff2_ground.i[817,830] [2025-03-08 00:08:33,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:08:33,286 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:08:33,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33 WrapperNode [2025-03-08 00:08:33,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:08:33,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:08:33,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:08:33,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:08:33,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,306 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-03-08 00:08:33,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:08:33,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:08:33,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:08:33,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:08:33,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,321 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 00:08:33,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:08:33,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:08:33,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:08:33,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:08:33,332 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (1/1) ... [2025-03-08 00:08:33,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:08:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:33,358 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 00:08:33,361 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 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:08:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:08:33,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:08:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:08:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:08:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:08:33,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:08:33,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:08:33,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-08 00:08:33,541 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 00:08:33,542 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:08:33,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:08:33,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:08:33,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:33 BoogieIcfgContainer [2025-03-08 00:08:33,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:08:33,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:08:33,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:08:33,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:08:33,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:08:33" (1/3) ... [2025-03-08 00:08:33,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83b10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:33, skipping insertion in model container [2025-03-08 00:08:33,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:33" (2/3) ... [2025-03-08 00:08:33,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e83b10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:33, skipping insertion in model container [2025-03-08 00:08:33,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:33" (3/3) ... [2025-03-08 00:08:33,555 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_allDiff2_ground.i [2025-03-08 00:08:33,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:08:33,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_allDiff2_ground.i that has 1 procedures, 18 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 00:08:33,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:08:33,607 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;@c312611, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:08:33,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:08:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:08:33,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:33,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:33,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -596628948, now seen corresponding path program 1 times [2025-03-08 00:08:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877197694] [2025-03-08 00:08:33,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:33,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:08:33,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:08:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:08:33,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877197694] [2025-03-08 00:08:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877197694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:08:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281838750] [2025-03-08 00:08:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:33,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:08:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:33,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:08:33,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:08:33,796 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:33,821 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2025-03-08 00:08:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:08:33,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:08:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:33,827 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:08:33,827 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:08:33,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:08:33,831 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:33,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:08:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:08:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-08 00:08:33,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2025-03-08 00:08:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:33,853 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-08 00:08:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-08 00:08:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:08:33,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:33,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:33,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:08:33,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:33,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1544674293, now seen corresponding path program 1 times [2025-03-08 00:08:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464494731] [2025-03-08 00:08:33,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:33,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:08:33,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:08:33,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:33,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:33,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464494731] [2025-03-08 00:08:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464494731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:33,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:33,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:08:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530064029] [2025-03-08 00:08:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:33,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:08:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:08:33,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:08:33,961 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:33,990 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2025-03-08 00:08:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:08:33,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:08:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:33,991 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:08:33,991 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:08:33,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 00:08:33,992 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:33,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:08:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2025-03-08 00:08:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-08 00:08:33,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-03-08 00:08:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-08 00:08:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-03-08 00:08:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:08:33,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:33,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:08:34,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1334889872, now seen corresponding path program 1 times [2025-03-08 00:08:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62444709] [2025-03-08 00:08:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:08:34,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:08:34,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:34,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62444709] [2025-03-08 00:08:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62444709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143181891] [2025-03-08 00:08:34,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:34,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:34,058 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 00:08:34,060 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 00:08:34,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:08:34,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:08:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:34,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:08:34,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:34,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143181891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:34,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:34,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:08:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896444078] [2025-03-08 00:08:34,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:34,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:08:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:34,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:08:34,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:08:34,181 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:34,221 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2025-03-08 00:08:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:08:34,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:08:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:34,222 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:08:34,222 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:08:34,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:08:34,223 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:34,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:08:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2025-03-08 00:08:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-08 00:08:34,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-03-08 00:08:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-08 00:08:34,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-08 00:08:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:08:34,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:34,230 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:34,236 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 00:08:34,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:34,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1614014759, now seen corresponding path program 2 times [2025-03-08 00:08:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421521392] [2025-03-08 00:08:34,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:34,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 00:08:34,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:08:34,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:08:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421521392] [2025-03-08 00:08:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421521392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026078325] [2025-03-08 00:08:34,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:34,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:34,560 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 00:08:34,561 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 00:08:34,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 00:08:34,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:08:34,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:34,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:34,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:08:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:34,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:08:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026078325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:34,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-08 00:08:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468971463] [2025-03-08 00:08:34,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:08:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:08:34,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:08:34,770 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:34,899 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-03-08 00:08:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:08:34,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:08:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:34,901 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:08:34,901 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:08:34,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:08:34,901 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 126 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:34,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 82 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:08:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:08:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-08 00:08:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2025-03-08 00:08:34,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 15 [2025-03-08 00:08:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:34,919 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2025-03-08 00:08:34,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2025-03-08 00:08:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:08:34,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:34,920 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:34,925 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 00:08:35,120 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,SelfDestructingSolverStorable3 [2025-03-08 00:08:35,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1752082921, now seen corresponding path program 1 times [2025-03-08 00:08:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94931637] [2025-03-08 00:08:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:35,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:08:35,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:08:35,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:35,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94931637] [2025-03-08 00:08:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94931637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426843635] [2025-03-08 00:08:35,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:35,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:35,366 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 00:08:35,367 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 00:08:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:08:35,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:08:35,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:35,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:08:35,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:35,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426843635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:35,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:08:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348124330] [2025-03-08 00:08:35,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:08:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:35,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:08:35,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:08:35,692 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:35,861 INFO L93 Difference]: Finished difference Result 163 states and 252 transitions. [2025-03-08 00:08:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:08:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 00:08:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:35,863 INFO L225 Difference]: With dead ends: 163 [2025-03-08 00:08:35,863 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 00:08:35,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:08:35,864 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 295 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:35,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 116 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:08:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 00:08:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 70. [2025-03-08 00:08:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-08 00:08:35,881 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 40 [2025-03-08 00:08:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:35,882 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-08 00:08:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-08 00:08:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:08:35,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:35,884 INFO L218 NwaCegarLoop]: trace histogram [22, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:35,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:08:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:36,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 579875625, now seen corresponding path program 2 times [2025-03-08 00:08:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443047843] [2025-03-08 00:08:36,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:36,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:08:36,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:08:36,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:36,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443047843] [2025-03-08 00:08:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443047843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815892549] [2025-03-08 00:08:36,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:36,664 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 00:08:36,666 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 00:08:36,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:08:36,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:08:36,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:36,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:08:36,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:36,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:08:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815892549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:37,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 00:08:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013266515] [2025-03-08 00:08:37,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:37,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:08:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:37,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:08:37,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:08:37,443 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:37,796 INFO L93 Difference]: Finished difference Result 283 states and 456 transitions. [2025-03-08 00:08:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:08:37,796 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 00:08:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:37,797 INFO L225 Difference]: With dead ends: 283 [2025-03-08 00:08:37,797 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:08:37,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:08:37,801 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 640 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:37,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 194 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:08:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:08:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 94. [2025-03-08 00:08:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 93 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2025-03-08 00:08:37,812 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 52 [2025-03-08 00:08:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:37,812 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2025-03-08 00:08:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2025-03-08 00:08:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 00:08:37,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:37,814 INFO L218 NwaCegarLoop]: trace histogram [46, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:37,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:08:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:38,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:38,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -19421783, now seen corresponding path program 3 times [2025-03-08 00:08:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925598115] [2025-03-08 00:08:38,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:08:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:38,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 24 equivalence classes. [2025-03-08 00:08:38,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 76 statements. [2025-03-08 00:08:38,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:08:38,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-08 00:08:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:38,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925598115] [2025-03-08 00:08:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925598115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:38,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:08:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550507190] [2025-03-08 00:08:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:38,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:08:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:38,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:08:38,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:08:38,093 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:38,137 INFO L93 Difference]: Finished difference Result 165 states and 227 transitions. [2025-03-08 00:08:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:08:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-08 00:08:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:38,138 INFO L225 Difference]: With dead ends: 165 [2025-03-08 00:08:38,139 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 00:08:38,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:08:38,140 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:38,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 45 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 00:08:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2025-03-08 00:08:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2025-03-08 00:08:38,161 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 76 [2025-03-08 00:08:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:38,162 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2025-03-08 00:08:38,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2025-03-08 00:08:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 00:08:38,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:38,165 INFO L218 NwaCegarLoop]: trace histogram [46, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:38,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:08:38,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1328800081, now seen corresponding path program 4 times [2025-03-08 00:08:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001851855] [2025-03-08 00:08:38,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:08:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:38,195 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-03-08 00:08:38,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 00:08:38,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:08:38,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 00:08:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001851855] [2025-03-08 00:08:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001851855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446525799] [2025-03-08 00:08:39,694 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:08:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:39,696 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 00:08:39,698 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 00:08:39,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-03-08 00:08:39,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 00:08:39,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:08:39,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:39,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:08:39,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2025-03-08 00:08:39,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2025-03-08 00:08:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446525799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:40,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:40,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 13, 13] total 60 [2025-03-08 00:08:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077545858] [2025-03-08 00:08:40,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:40,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-08 00:08:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:40,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-08 00:08:40,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:08:40,214 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 60 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 60 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:40,763 INFO L93 Difference]: Finished difference Result 436 states and 678 transitions. [2025-03-08 00:08:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-08 00:08:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 60 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-08 00:08:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:40,766 INFO L225 Difference]: With dead ends: 436 [2025-03-08 00:08:40,766 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 00:08:40,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:08:40,767 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 791 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:40,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 229 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:08:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 00:08:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 294. [2025-03-08 00:08:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.3993174061433447) internal successors, (410), 293 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 410 transitions. [2025-03-08 00:08:40,843 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 410 transitions. Word has length 79 [2025-03-08 00:08:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 410 transitions. [2025-03-08 00:08:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 60 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:08:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 410 transitions. [2025-03-08 00:08:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 00:08:40,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:40,845 INFO L218 NwaCegarLoop]: trace histogram [57, 56, 56, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:40,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:08:41,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:41,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1618676067, now seen corresponding path program 5 times [2025-03-08 00:08:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:41,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614710937] [2025-03-08 00:08:41,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:08:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:41,069 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 184 statements into 59 equivalence classes. [2025-03-08 00:08:41,345 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) and asserted 175 of 184 statements. [2025-03-08 00:08:41,345 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2025-03-08 00:08:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4904 backedges. 3140 proven. 109 refuted. 0 times theorem prover too weak. 1655 trivial. 0 not checked. [2025-03-08 00:08:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614710937] [2025-03-08 00:08:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614710937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733700156] [2025-03-08 00:08:43,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:08:43,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:43,414 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 00:08:43,416 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 00:08:43,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 184 statements into 59 equivalence classes.