./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c -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 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:02:50,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:02:50,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:02:50,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:02:50,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:02:50,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:02:50,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:02:50,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:02:50,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:02:50,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:02:50,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:02:50,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:02:50,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:02:50,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:02:50,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:02:50,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:02:50,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:02:50,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:02:50,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:02:50,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:02:50,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:02:50,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:02:50,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:02:50,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:02:50,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:02:50,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:02:50,325 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 -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2025-03-08 05:02:50,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:02:50,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:02:50,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:02:50,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:02:50,546 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:02:50,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2025-03-08 05:02:51,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50df5974/2f17ef0071ef44d5953eadf36af3261d/FLAG0d55f63fb [2025-03-08 05:02:51,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:02:51,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2025-03-08 05:02:51,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50df5974/2f17ef0071ef44d5953eadf36af3261d/FLAG0d55f63fb [2025-03-08 05:02:52,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50df5974/2f17ef0071ef44d5953eadf36af3261d [2025-03-08 05:02:52,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:02:52,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:02:52,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:02:52,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:02:52,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:02:52,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65170cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52, skipping insertion in model container [2025-03-08 05:02:52,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:02:52,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2025-03-08 05:02:52,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:02:52,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:02:52,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2025-03-08 05:02:52,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:02:52,442 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:02:52,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52 WrapperNode [2025-03-08 05:02:52,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:02:52,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:02:52,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:02:52,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:02:52,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,466 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-03-08 05:02:52,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:02:52,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:02:52,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:02:52,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:02:52,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:02:52,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:02:52,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:02:52,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:02:52,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:02:52,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (1/1) ... [2025-03-08 05:02:52,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:02:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:52,527 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 05:02:52,533 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 05:02:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:02:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:02:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:02:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:02:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:02:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:02:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:02:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:02:52,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:02:52,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:02:52,737 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-08 05:02:52,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:02:52,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:02:52,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:02:52,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:02:52 BoogieIcfgContainer [2025-03-08 05:02:52,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:02:52,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:02:52,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:02:52,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:02:52,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:02:52" (1/3) ... [2025-03-08 05:02:52,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350645b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:02:52, skipping insertion in model container [2025-03-08 05:02:52,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:02:52" (2/3) ... [2025-03-08 05:02:52,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350645b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:02:52, skipping insertion in model container [2025-03-08 05:02:52,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:02:52" (3/3) ... [2025-03-08 05:02:52,753 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2025-03-08 05:02:52,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:02:52,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound10.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 05:02:52,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:02:52,820 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;@5328c05d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:02:52,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:02:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:02:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 05:02:52,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:52,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:52,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:52,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash -758256744, now seen corresponding path program 1 times [2025-03-08 05:02:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:52,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648963102] [2025-03-08 05:02:52,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 05:02:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 05:02:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:02:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648963102] [2025-03-08 05:02:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648963102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847772879] [2025-03-08 05:02:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:52,956 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 05:02:52,968 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 05:02:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 05:02:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 05:02:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:53,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:02:53,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:02:53,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:02:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847772879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:53,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:02:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:02:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78611041] [2025-03-08 05:02:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:02:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:53,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:02:53,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:02:53,052 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:02:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:53,067 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-03-08 05:02:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:02:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-08 05:02:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:53,074 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:02:53,075 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 05:02:53,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:02:53,080 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:53,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:02:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 05:02:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 05:02:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:02:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-08 05:02:53,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-03-08 05:02:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:53,108 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-08 05:02:53,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:02:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-08 05:02:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:02:53,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:53,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:53,115 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 05:02:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:02:53,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:53,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash -766943530, now seen corresponding path program 1 times [2025-03-08 05:02:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341507169] [2025-03-08 05:02:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:53,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:02:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:02:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:02:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669965787] [2025-03-08 05:02:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:53,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:53,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:53,345 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 05:02:53,347 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 05:02:53,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:02:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:02:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:53,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:02:53,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:53,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:02:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341507169] [2025-03-08 05:02:53,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:02:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669965787] [2025-03-08 05:02:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669965787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:02:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:02:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883106401] [2025-03-08 05:02:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:02:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:53,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:02:53,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:02:53,577 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:02:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:55,230 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-03-08 05:02:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:02:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-08 05:02:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:55,231 INFO L225 Difference]: With dead ends: 47 [2025-03-08 05:02:55,231 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:02:55,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:02:55,232 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:55,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:02:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:02:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-08 05:02:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:02:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-03-08 05:02:55,244 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-03-08 05:02:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:55,244 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-03-08 05:02:55,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:02:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-03-08 05:02:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:02:55,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:55,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:55,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:02:55,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:02:55,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -766198755, now seen corresponding path program 1 times [2025-03-08 05:02:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194843293] [2025-03-08 05:02:55,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:02:55,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:02:55,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194843293] [2025-03-08 05:02:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194843293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:55,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:02:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:02:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874854044] [2025-03-08 05:02:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:55,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:02:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:55,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:02:55,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:02:55,513 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:02:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:55,538 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-03-08 05:02:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:02:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-08 05:02:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:55,540 INFO L225 Difference]: With dead ends: 53 [2025-03-08 05:02:55,540 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:02:55,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:02:55,541 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:55,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:02:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:02:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 05:02:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:02:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-03-08 05:02:55,550 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-03-08 05:02:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-08 05:02:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:02:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-03-08 05:02:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:02:55,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:55,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:55,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:02:55,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1891524392, now seen corresponding path program 1 times [2025-03-08 05:02:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581864605] [2025-03-08 05:02:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:55,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:02:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:02:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581864605] [2025-03-08 05:02:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581864605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516065922] [2025-03-08 05:02:55,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:55,799 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 05:02:55,799 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 05:02:55,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:02:55,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:02:55,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:55,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:55,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:02:55,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:55,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:02:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516065922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:02:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:02:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-08 05:02:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242541331] [2025-03-08 05:02:56,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:02:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:02:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:56,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:02:56,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:02:56,004 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:02:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:56,096 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-08 05:02:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:02:56,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2025-03-08 05:02:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:56,097 INFO L225 Difference]: With dead ends: 53 [2025-03-08 05:02:56,097 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 05:02:56,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:02:56,098 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:56,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:02:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 05:02:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-03-08 05:02:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:02:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-08 05:02:56,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-03-08 05:02:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:56,111 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-08 05:02:56,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:02:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-08 05:02:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:02:56,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:56,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:56,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:02:56,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:56,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:56,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2058223402, now seen corresponding path program 1 times [2025-03-08 05:02:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287872423] [2025-03-08 05:02:56,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:02:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:02:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:56,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287872423] [2025-03-08 05:02:56,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287872423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:56,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:02:56,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:02:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577558233] [2025-03-08 05:02:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:02:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:56,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:02:56,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:02:56,386 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:02:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:56,419 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-03-08 05:02:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:02:56,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-08 05:02:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:56,421 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:02:56,421 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 05:02:56,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:02:56,422 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:56,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:02:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 05:02:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 05:02:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:02:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-08 05:02:56,435 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2025-03-08 05:02:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:56,436 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-08 05:02:56,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:02:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-08 05:02:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:02:56,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:56,438 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:56,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:02:56,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:56,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1717573043, now seen corresponding path program 1 times [2025-03-08 05:02:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222763592] [2025-03-08 05:02:56,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:56,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:02:56,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:02:56,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:56,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:02:56,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222763592] [2025-03-08 05:02:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222763592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:02:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:02:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541171208] [2025-03-08 05:02:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:56,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:02:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:02:56,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:02:56,514 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:02:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:56,568 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-03-08 05:02:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:02:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-03-08 05:02:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:56,571 INFO L225 Difference]: With dead ends: 70 [2025-03-08 05:02:56,571 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 05:02:56,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:02:56,572 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:56,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:02:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 05:02:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-08 05:02:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:02:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-08 05:02:56,588 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2025-03-08 05:02:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:56,589 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-08 05:02:56,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:02:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-08 05:02:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:02:56,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:56,590 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:02:56,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:56,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1141283122, now seen corresponding path program 1 times [2025-03-08 05:02:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729823940] [2025-03-08 05:02:56,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:56,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:02:56,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:02:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:02:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729823940] [2025-03-08 05:02:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729823940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852836993] [2025-03-08 05:02:56,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:56,700 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 05:02:56,701 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 05:02:56,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:02:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:02:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:02:56,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:56,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:02:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:02:56,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852836993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:02:56,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:02:56,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-08 05:02:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887115882] [2025-03-08 05:02:56,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:02:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:02:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:56,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:02:56,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:02:56,850 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:02:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:56,994 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-03-08 05:02:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:02:56,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2025-03-08 05:02:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:56,995 INFO L225 Difference]: With dead ends: 125 [2025-03-08 05:02:56,995 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 05:02:56,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:02:56,996 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:56,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 141 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:02:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 05:02:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-03-08 05:02:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 05:02:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-03-08 05:02:57,026 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2025-03-08 05:02:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:57,027 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-08 05:02:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:02:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2025-03-08 05:02:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:02:57,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:57,029 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:57,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:02:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:57,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 318935871, now seen corresponding path program 1 times [2025-03-08 05:02:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564372561] [2025-03-08 05:02:57,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:57,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:02:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:02:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:02:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564372561] [2025-03-08 05:02:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564372561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:02:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:02:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:02:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382005847] [2025-03-08 05:02:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:02:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:02:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:57,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:02:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:02:57,294 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:02:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:57,336 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2025-03-08 05:02:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:02:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-03-08 05:02:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:57,338 INFO L225 Difference]: With dead ends: 154 [2025-03-08 05:02:57,338 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 05:02:57,338 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 05:02:57,339 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:57,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:02:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 05:02:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-03-08 05:02:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:02:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-03-08 05:02:57,373 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2025-03-08 05:02:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:57,373 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-03-08 05:02:57,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:02:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-03-08 05:02:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 05:02:57,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:57,374 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:02:57,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:57,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 191952453, now seen corresponding path program 1 times [2025-03-08 05:02:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:57,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975742064] [2025-03-08 05:02:57,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:57,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 05:02:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:02:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:02:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975742064] [2025-03-08 05:02:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975742064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965063273] [2025-03-08 05:02:57,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:57,475 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 05:02:57,475 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 05:02:57,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 05:02:57,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:02:57,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:57,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:57,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:02:57,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:57,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:02:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:02:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965063273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:02:57,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:02:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-03-08 05:02:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361556200] [2025-03-08 05:02:57,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:02:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:02:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:57,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:02:57,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:02:57,656 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 05:02:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:57,831 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-03-08 05:02:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:02:57,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2025-03-08 05:02:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:57,833 INFO L225 Difference]: With dead ends: 215 [2025-03-08 05:02:57,833 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 05:02:57,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:02:57,834 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:57,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:02:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 05:02:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-03-08 05:02:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 05:02:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-03-08 05:02:57,881 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2025-03-08 05:02:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:57,882 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-03-08 05:02:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 05:02:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-03-08 05:02:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 05:02:57,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:57,882 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:57,888 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 05:02:58,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:58,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1202242871, now seen corresponding path program 1 times [2025-03-08 05:02:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255039839] [2025-03-08 05:02:58,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:58,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:02:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:02:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:02:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255039839] [2025-03-08 05:02:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255039839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256790675] [2025-03-08 05:02:58,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:02:58,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:58,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:58,198 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 05:02:58,199 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 05:02:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:02:58,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:02:58,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:02:58,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:58,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:02:58,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:58,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:02:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:02:58,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256790675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:02:58,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:02:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-08 05:02:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399447836] [2025-03-08 05:02:58,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:02:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:02:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:58,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:02:58,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:02:58,411 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-08 05:02:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:58,643 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-03-08 05:02:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:02:58,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2025-03-08 05:02:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:58,645 INFO L225 Difference]: With dead ends: 207 [2025-03-08 05:02:58,645 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 05:02:58,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:02:58,645 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 143 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:58,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 171 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:02:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 05:02:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-03-08 05:02:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:02:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-03-08 05:02:58,680 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2025-03-08 05:02:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:58,680 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-03-08 05:02:58,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-08 05:02:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-03-08 05:02:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:02:58,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:58,682 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:58,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:02:58,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:58,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:02:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:02:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -760810850, now seen corresponding path program 2 times [2025-03-08 05:02:58,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:02:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960568623] [2025-03-08 05:02:58,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:02:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:02:58,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-08 05:02:58,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:02:58,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:02:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:02:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:02:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960568623] [2025-03-08 05:02:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960568623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:02:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388283047] [2025-03-08 05:02:59,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:02:59,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:02:59,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:02:59,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:02:59,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:02:59,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-08 05:02:59,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:02:59,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:02:59,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:02:59,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:02:59,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:02:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:02:59,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:02:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:02:59,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388283047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:02:59,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:02:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 14 [2025-03-08 05:02:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191887734] [2025-03-08 05:02:59,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:02:59,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:02:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:02:59,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:02:59,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:02:59,500 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-08 05:02:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:02:59,781 INFO L93 Difference]: Finished difference Result 262 states and 344 transitions. [2025-03-08 05:02:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:02:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 87 [2025-03-08 05:02:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:02:59,784 INFO L225 Difference]: With dead ends: 262 [2025-03-08 05:02:59,784 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 05:02:59,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:02:59,787 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 116 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:02:59,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 196 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:02:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 05:02:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-03-08 05:02:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:02:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2025-03-08 05:02:59,819 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 87 [2025-03-08 05:02:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:02:59,820 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2025-03-08 05:02:59,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-08 05:02:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2025-03-08 05:02:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:02:59,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:02:59,821 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:02:59,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:03:00,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:03:00,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:03:00,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:03:00,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1449499115, now seen corresponding path program 2 times [2025-03-08 05:03:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:03:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965503990] [2025-03-08 05:03:00,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:03:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:03:00,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:03:00,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:03:00,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:03:00,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:03:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 05:03:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:03:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965503990] [2025-03-08 05:03:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965503990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:03:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361260201] [2025-03-08 05:03:00,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:03:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:03:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:03:00,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:03:00,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:03:00,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:03:00,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:03:00,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:03:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:03:00,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:03:00,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:03:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:03:00,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:03:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 05:03:00,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361260201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:03:00,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:03:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 13 [2025-03-08 05:03:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854182238] [2025-03-08 05:03:00,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:03:00,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:03:00,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:03:00,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:03:00,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:03:00,693 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-08 05:03:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:03:00,914 INFO L93 Difference]: Finished difference Result 245 states and 317 transitions. [2025-03-08 05:03:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:03:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 93 [2025-03-08 05:03:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:03:00,918 INFO L225 Difference]: With dead ends: 245 [2025-03-08 05:03:00,918 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 05:03:00,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 175 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:03:00,919 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 78 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:03:00,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 187 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:03:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 05:03:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 05:03:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.1818181818181819) internal successors, (182), 154 states have internal predecessors, (182), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:03:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 257 transitions. [2025-03-08 05:03:00,960 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 257 transitions. Word has length 93 [2025-03-08 05:03:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:03:00,961 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 257 transitions. [2025-03-08 05:03:00,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-08 05:03:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 257 transitions. [2025-03-08 05:03:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:03:00,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:03:00,966 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:03:00,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:03:01,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:03:01,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:03:01,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:03:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1311565561, now seen corresponding path program 2 times [2025-03-08 05:03:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:03:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716519868] [2025-03-08 05:03:01,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:03:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:03:01,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-08 05:03:01,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:03:01,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:03:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:03:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-08 05:03:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:03:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716519868] [2025-03-08 05:03:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716519868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:03:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315076695] [2025-03-08 05:03:01,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:03:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:03:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:03:01,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:03:01,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:03:01,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-08 05:03:01,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:03:01,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:03:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:03:01,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:03:01,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:03:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 05:03:01,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:03:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315076695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:03:03,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:03:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2025-03-08 05:03:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340149015] [2025-03-08 05:03:03,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:03:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:03:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:03:03,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:03:03,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2025-03-08 05:03:03,206 INFO L87 Difference]: Start difference. First operand 204 states and 257 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:03:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:03:03,377 INFO L93 Difference]: Finished difference Result 387 states and 500 transitions. [2025-03-08 05:03:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:03:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2025-03-08 05:03:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:03:03,379 INFO L225 Difference]: With dead ends: 387 [2025-03-08 05:03:03,379 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 05:03:03,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2025-03-08 05:03:03,380 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:03:03,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 250 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:03:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 05:03:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 194. [2025-03-08 05:03:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 146 states have internal predecessors, (168), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 05:03:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2025-03-08 05:03:03,430 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 99 [2025-03-08 05:03:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:03:03,430 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2025-03-08 05:03:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:03:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2025-03-08 05:03:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:03:03,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:03:03,432 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:03:03,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:03:03,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:03:03,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:03:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:03:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -369859294, now seen corresponding path program 1 times [2025-03-08 05:03:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:03:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522519] [2025-03-08 05:03:03,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:03:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:03:03,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:03:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:03:03,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:03:03,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:03:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980199216] [2025-03-08 05:03:03,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:03:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:03:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:03:03,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:03:03,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:03:03,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:03:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:03:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:03:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:03:03,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:03:03,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:03:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:03:03,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:03:03,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:03:03,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:03:03,775 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:03:03,776 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:03:03,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:03:03,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:03:03,980 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:03:04,006 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:03:04,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:03:04 BoogieIcfgContainer [2025-03-08 05:03:04,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:03:04,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:03:04,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:03:04,009 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:03:04,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:02:52" (3/4) ... [2025-03-08 05:03:04,011 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:03:04,062 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 71. [2025-03-08 05:03:04,133 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:03:04,133 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:03:04,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:03:04,134 INFO L158 Benchmark]: Toolchain (without parser) took 11858.76ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.1MB in the beginning and 235.3MB in the end (delta: -130.2MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,134 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:03:04,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.33ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.02ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,135 INFO L158 Benchmark]: Boogie Preprocessor took 31.54ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:03:04,135 INFO L158 Benchmark]: IcfgBuilder took 245.65ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 78.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,135 INFO L158 Benchmark]: TraceAbstraction took 11260.49ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 78.1MB in the beginning and 243.2MB in the end (delta: -165.1MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,135 INFO L158 Benchmark]: Witness Printer took 125.04ms. Allocated memory is still 310.4MB. Free memory was 243.2MB in the beginning and 235.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:03:04,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.33ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.02ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.54ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 245.65ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 78.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11260.49ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 78.1MB in the beginning and 243.2MB in the end (delta: -165.1MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. * Witness Printer took 125.04ms. Allocated memory is still 310.4MB. Free memory was 243.2MB in the beginning and 235.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=199, R=15, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=199, R=15, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=199, counter=0, r=26, u=31, v=1] [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [A=199, counter=1, r=26, u=31, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=1, r=26, u=31, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=199, counter=1, r=26, u=31, v=1] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=2, r=26, u=31, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=2, r=26, u=31, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=2, r=25, u=31, v=3] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=3, r=25, u=31, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=3, r=25, u=31, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=3, r=22, u=31, v=5] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=4, r=22, u=31, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=4, r=22, u=31, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=4, r=17, u=31, v=7] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=5, r=17, u=31, v=7] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=5, r=17, u=31, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=5, r=10, u=31, v=9] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=6, r=10, u=31, v=9] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=6, r=10, u=31, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=6, r=1, u=31, v=11] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=7, r=1, u=31, v=11] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=7, r=1, u=31, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=7, r=-10, u=31, v=13] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=8, r=-10, u=31, v=13] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=8, r=-10, u=31, v=13] [L41] COND TRUE !(r > 0) VAL [A=199, counter=8, r=-10, u=31, v=13] [L47] COND TRUE counter++<10 [L47] EXPR counter++ VAL [A=199, counter=9, r=-10, u=31, v=13] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=9, r=-10, u=31, v=13] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=199, counter=9, r=21, u=33, v=13] [L47] COND TRUE counter++<10 [L47] EXPR counter++ VAL [A=199, counter=10, r=21, u=33, v=13] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=10, r=21, u=33, v=13] [L49] COND TRUE !(r < 0) VAL [A=199, counter=10, r=21, u=33, v=13] [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [A=199, counter=11, r=21, u=33, v=13] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 1745 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1314 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 431 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 930 GetRequests, 785 SyntacticMatches, 23 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=12, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1376 ConstructedInterpolants, 0 QuantifiedInterpolants, 3216 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1258 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1538/2510 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:03:04,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE