./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.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 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:20:47,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:20:47,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:20:47,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:20:47,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:20:47,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:20:47,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:20:47,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:20:47,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:20:47,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:20:47,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:20:47,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:20:47,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:20:47,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:20:47,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:20:47,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:20:47,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:20:47,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:20:47,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:20:47,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:20:47,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:20:47,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:20:47,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:20:47,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:20:47,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:20:47,904 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 -> 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b [2025-03-16 18:20:48,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:20:48,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:20:48,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:20:48,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:20:48,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:20:48,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-03-16 18:20:49,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d28d0ad4/6386e27f3ae34c9f866816a4cc472207/FLAG060b7890b [2025-03-16 18:20:49,369 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:20:49,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-03-16 18:20:49,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d28d0ad4/6386e27f3ae34c9f866816a4cc472207/FLAG060b7890b [2025-03-16 18:20:49,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d28d0ad4/6386e27f3ae34c9f866816a4cc472207 [2025-03-16 18:20:49,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:20:49,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:20:49,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:20:49,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:20:49,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:20:49,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eab96b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49, skipping insertion in model container [2025-03-16 18:20:49,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:20:49,500 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/hard2_unwindbound5.c[526,539] [2025-03-16 18:20:49,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:20:49,522 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:20:49,531 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/hard2_unwindbound5.c[526,539] [2025-03-16 18:20:49,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:20:49,547 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:20:49,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49 WrapperNode [2025-03-16 18:20:49,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:20:49,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:20:49,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:20:49,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:20:49,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,572 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2025-03-16 18:20:49,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:20:49,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:20:49,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:20:49,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:20:49,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,594 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 18:20:49,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:20:49,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:20:49,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:20:49,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:20:49,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (1/1) ... [2025-03-16 18:20:49,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:20:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:49,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:20:49,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:20:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:20:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:20:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:20:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:20:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:20:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:20:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:20:49,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:20:49,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:20:49,810 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-16 18:20:49,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:20:49,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:20:49,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:20:49,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:20:49 BoogieIcfgContainer [2025-03-16 18:20:49,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:20:49,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:20:49,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:20:49,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:20:49,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:20:49" (1/3) ... [2025-03-16 18:20:49,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a687c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:20:49, skipping insertion in model container [2025-03-16 18:20:49,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:20:49" (2/3) ... [2025-03-16 18:20:49,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a687c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:20:49, skipping insertion in model container [2025-03-16 18:20:49,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:20:49" (3/3) ... [2025-03-16 18:20:49,822 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2025-03-16 18:20:49,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:20:49,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_unwindbound5.c that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 18:20:49,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:20:49,873 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;@5dce68c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:20:49,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:20:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 18:20:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 18:20:49,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:49,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:49,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash -243078552, now seen corresponding path program 1 times [2025-03-16 18:20:49,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154948082] [2025-03-16 18:20:49,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:49,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 18:20:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 18:20:49,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:49,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:20:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154948082] [2025-03-16 18:20:50,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154948082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:20:50,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:20:50,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:20:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675269169] [2025-03-16 18:20:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:50,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:20:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:50,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:20:50,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:20:50,102 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:20:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:50,158 INFO L93 Difference]: Finished difference Result 60 states and 105 transitions. [2025-03-16 18:20:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:20:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 18:20:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:50,163 INFO L225 Difference]: With dead ends: 60 [2025-03-16 18:20:50,163 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 18:20:50,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-16 18:20:50,167 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:50,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:20:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 18:20:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2025-03-16 18:20:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:20:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-16 18:20:50,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2025-03-16 18:20:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:50,190 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-16 18:20:50,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:20:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-16 18:20:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 18:20:50,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:50,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:50,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:20:50,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:50,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1746604979, now seen corresponding path program 1 times [2025-03-16 18:20:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:50,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415250489] [2025-03-16 18:20:50,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:50,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 18:20:50,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 18:20:50,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:20:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:50,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415250489] [2025-03-16 18:20:50,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415250489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:20:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:20:50,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:20:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158094881] [2025-03-16 18:20:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:50,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:20:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:50,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:20:50,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:20:50,254 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:20:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:50,270 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-03-16 18:20:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:20:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 18:20:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:50,271 INFO L225 Difference]: With dead ends: 41 [2025-03-16 18:20:50,271 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:20:50,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 18:20:50,272 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:50,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:20:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:20:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:20:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:20:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-03-16 18:20:50,283 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2025-03-16 18:20:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:50,283 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-16 18:20:50,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:20:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-03-16 18:20:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 18:20:50,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:50,285 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:50,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:20:50,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:50,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash -308559561, now seen corresponding path program 1 times [2025-03-16 18:20:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736283187] [2025-03-16 18:20:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:50,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 18:20:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 18:20:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:20:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736283187] [2025-03-16 18:20:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736283187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:20:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:20:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:20:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512159501] [2025-03-16 18:20:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:50,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:20:50,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:20:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:20:50,375 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:20:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:50,415 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2025-03-16 18:20:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:20:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-16 18:20:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:50,416 INFO L225 Difference]: With dead ends: 41 [2025-03-16 18:20:50,416 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 18:20:50,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-16 18:20:50,417 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:50,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:20:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 18:20:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2025-03-16 18:20:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:20:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-16 18:20:50,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2025-03-16 18:20:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-16 18:20:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:20:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-16 18:20:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 18:20:50,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:50,423 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:20:50,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1320598536, now seen corresponding path program 1 times [2025-03-16 18:20:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963423875] [2025-03-16 18:20:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:20:50,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:20:50,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876392229] [2025-03-16 18:20:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:50,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:20:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:20:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:20:50,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:20:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:50,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:20:50,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:50,561 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-16 18:20:50,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:20:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963423875] [2025-03-16 18:20:50,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:20:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876392229] [2025-03-16 18:20:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876392229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:20:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:20:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:20:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271685189] [2025-03-16 18:20:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:50,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:20:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:50,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:20:50,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:20:50,562 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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-16 18:20:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:50,629 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-03-16 18:20:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:20:50,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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 17 [2025-03-16 18:20:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:50,631 INFO L225 Difference]: With dead ends: 60 [2025-03-16 18:20:50,631 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 18:20:50,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-16 18:20:50,632 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:50,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 18:20:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-16 18:20:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-16 18:20:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2025-03-16 18:20:50,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2025-03-16 18:20:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2025-03-16 18:20:50,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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-16 18:20:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2025-03-16 18:20:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 18:20:50,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:50,641 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:50,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:20:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:50,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 969690117, now seen corresponding path program 1 times [2025-03-16 18:20:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862398692] [2025-03-16 18:20:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:50,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 18:20:50,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 18:20:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:50,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541971269] [2025-03-16 18:20:50,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:50,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:20:50,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:20:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 18:20:50,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 18:20:50,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:50,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 18:20:50,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:20:50,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:20:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862398692] [2025-03-16 18:20:51,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:20:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541971269] [2025-03-16 18:20:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541971269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:51,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:20:51,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-16 18:20:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639329411] [2025-03-16 18:20:51,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:20:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:51,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:20:51,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:20:51,098 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:20:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:51,185 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-03-16 18:20:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:20:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-16 18:20:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:51,187 INFO L225 Difference]: With dead ends: 63 [2025-03-16 18:20:51,187 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 18:20:51,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:20:51,188 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:51,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 18:20:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2025-03-16 18:20:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 18:20:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-03-16 18:20:51,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 25 [2025-03-16 18:20:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:51,197 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-03-16 18:20:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:20:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-03-16 18:20:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 18:20:51,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:51,197 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:51,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:20:51,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:51,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1882453671, now seen corresponding path program 1 times [2025-03-16 18:20:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774216887] [2025-03-16 18:20:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:51,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 18:20:51,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 18:20:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:20:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774216887] [2025-03-16 18:20:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774216887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745519589] [2025-03-16 18:20:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:51,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:51,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:51,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:20:51,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:20:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 18:20:51,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 18:20:51,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:51,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:20:51,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 18:20:51,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:20:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745519589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:51,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:20:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-03-16 18:20:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391868886] [2025-03-16 18:20:51,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:20:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:20:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:20:51,590 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:20:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:51,676 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2025-03-16 18:20:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:20:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 32 [2025-03-16 18:20:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:51,678 INFO L225 Difference]: With dead ends: 154 [2025-03-16 18:20:51,678 INFO L226 Difference]: Without dead ends: 129 [2025-03-16 18:20:51,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:20:51,679 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:51,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 122 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-16 18:20:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2025-03-16 18:20:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.205128205128205) internal successors, (94), 82 states have internal predecessors, (94), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 18:20:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2025-03-16 18:20:51,691 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 32 [2025-03-16 18:20:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2025-03-16 18:20:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:20:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2025-03-16 18:20:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 18:20:51,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:51,692 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 18:20:51,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:20:51,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:51,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:51,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 32836737, now seen corresponding path program 1 times [2025-03-16 18:20:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836156462] [2025-03-16 18:20:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:51,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 18:20:51,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 18:20:51,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40929788] [2025-03-16 18:20:51,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:51,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:51,912 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-16 18:20:51,913 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-16 18:20:51,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 18:20:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 18:20:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:51,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:20:51,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 18:20:52,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-16 18:20:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836156462] [2025-03-16 18:20:52,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:20:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40929788] [2025-03-16 18:20:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40929788] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:20:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-16 18:20:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334107639] [2025-03-16 18:20:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:52,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:20:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:52,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:20:52,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:20:52,068 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 18:20:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:52,971 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2025-03-16 18:20:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:20:52,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-16 18:20:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:52,975 INFO L225 Difference]: With dead ends: 145 [2025-03-16 18:20:52,975 INFO L226 Difference]: Without dead ends: 139 [2025-03-16 18:20:52,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:20:52,976 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:52,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 18:20:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-16 18:20:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-03-16 18:20:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 18:20:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2025-03-16 18:20:52,997 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 35 [2025-03-16 18:20:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2025-03-16 18:20:52,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 18:20:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2025-03-16 18:20:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 18:20:53,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:53,000 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:53,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:20:53,200 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-16 18:20:53,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:53,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1656085784, now seen corresponding path program 1 times [2025-03-16 18:20:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914429313] [2025-03-16 18:20:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:53,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 18:20:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 18:20:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 18:20:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914429313] [2025-03-16 18:20:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914429313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:20:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:20:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:20:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804362899] [2025-03-16 18:20:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:20:53,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:20:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:20:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:20:53,296 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 18:20:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:53,326 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2025-03-16 18:20:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:20:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2025-03-16 18:20:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:53,327 INFO L225 Difference]: With dead ends: 136 [2025-03-16 18:20:53,327 INFO L226 Difference]: Without dead ends: 117 [2025-03-16 18:20:53,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-16 18:20:53,328 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:53,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:20:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-16 18:20:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-16 18:20:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 79 states have internal predecessors, (90), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 18:20:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2025-03-16 18:20:53,341 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 41 [2025-03-16 18:20:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:53,342 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2025-03-16 18:20:53,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 18:20:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2025-03-16 18:20:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 18:20:53,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:53,343 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:53,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:20:53,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:53,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1309797316, now seen corresponding path program 1 times [2025-03-16 18:20:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659109452] [2025-03-16 18:20:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:53,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 18:20:53,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 18:20:53,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:53,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 18:20:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659109452] [2025-03-16 18:20:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659109452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72686186] [2025-03-16 18:20:53,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:53,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:53,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:53,413 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-16 18:20:53,414 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-16 18:20:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 18:20:53,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 18:20:53,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:53,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:20:53,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 18:20:53,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 18:20:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72686186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:20:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-03-16 18:20:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104411856] [2025-03-16 18:20:53,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:20:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:53,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:20:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:20:53,566 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-16 18:20:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:53,660 INFO L93 Difference]: Finished difference Result 193 states and 231 transitions. [2025-03-16 18:20:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:20:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 48 [2025-03-16 18:20:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:53,661 INFO L225 Difference]: With dead ends: 193 [2025-03-16 18:20:53,661 INFO L226 Difference]: Without dead ends: 172 [2025-03-16 18:20:53,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:20:53,662 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 43 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:53,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 140 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-16 18:20:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2025-03-16 18:20:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.18348623853211) internal successors, (129), 115 states have internal predecessors, (129), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 18:20:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2025-03-16 18:20:53,687 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 48 [2025-03-16 18:20:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:53,687 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2025-03-16 18:20:53,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-16 18:20:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2025-03-16 18:20:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 18:20:53,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:53,688 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:53,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:20:53,888 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-16 18:20:53,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 252673267, now seen corresponding path program 1 times [2025-03-16 18:20:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780668022] [2025-03-16 18:20:53,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:53,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 18:20:53,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 18:20:53,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:53,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033742123] [2025-03-16 18:20:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:53,921 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-16 18:20:53,922 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-16 18:20:53,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 18:20:53,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 18:20:53,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:53,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:53,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 18:20:53,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-16 18:20:54,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-16 18:20:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780668022] [2025-03-16 18:20:55,282 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:20:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033742123] [2025-03-16 18:20:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033742123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:55,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:20:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-16 18:20:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444849654] [2025-03-16 18:20:55,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:20:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:20:55,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:20:55,283 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-16 18:20:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:55,805 INFO L93 Difference]: Finished difference Result 260 states and 329 transitions. [2025-03-16 18:20:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 18:20:55,806 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 57 [2025-03-16 18:20:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:55,808 INFO L225 Difference]: With dead ends: 260 [2025-03-16 18:20:55,808 INFO L226 Difference]: Without dead ends: 222 [2025-03-16 18:20:55,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-16 18:20:55,809 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:55,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 245 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:20:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-16 18:20:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2025-03-16 18:20:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 140 states have (on average 1.2142857142857142) internal successors, (170), 147 states have internal predecessors, (170), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 18:20:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 256 transitions. [2025-03-16 18:20:55,846 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 256 transitions. Word has length 57 [2025-03-16 18:20:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 256 transitions. [2025-03-16 18:20:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-16 18:20:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 256 transitions. [2025-03-16 18:20:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 18:20:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:55,848 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:55,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 18:20:56,048 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-16 18:20:56,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -175219287, now seen corresponding path program 1 times [2025-03-16 18:20:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715156620] [2025-03-16 18:20:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 18:20:56,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 18:20:56,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:56,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267599919] [2025-03-16 18:20:56,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:56,076 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-16 18:20:56,090 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-16 18:20:56,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 18:20:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 18:20:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:56,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 18:20:56,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 18:20:56,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 18:20:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715156620] [2025-03-16 18:20:56,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:20:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267599919] [2025-03-16 18:20:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267599919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:56,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:20:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-16 18:20:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557803086] [2025-03-16 18:20:56,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:56,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 18:20:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:56,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 18:20:56,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:20:56,706 INFO L87 Difference]: Start difference. First operand 209 states and 256 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-16 18:20:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:57,024 INFO L93 Difference]: Finished difference Result 263 states and 327 transitions. [2025-03-16 18:20:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:20:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 68 [2025-03-16 18:20:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:57,026 INFO L225 Difference]: With dead ends: 263 [2025-03-16 18:20:57,026 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 18:20:57,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-16 18:20:57,027 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:57,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 234 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:20:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 18:20:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2025-03-16 18:20:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 134 states have internal predecessors, (151), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 18:20:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 225 transitions. [2025-03-16 18:20:57,077 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 225 transitions. Word has length 68 [2025-03-16 18:20:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:57,077 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 225 transitions. [2025-03-16 18:20:57,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-16 18:20:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 225 transitions. [2025-03-16 18:20:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 18:20:57,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:57,078 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:57,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 18:20:57,279 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-16 18:20:57,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:57,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1679407062, now seen corresponding path program 1 times [2025-03-16 18:20:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169326104] [2025-03-16 18:20:57,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 18:20:57,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 18:20:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 18:20:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169326104] [2025-03-16 18:20:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169326104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889175264] [2025-03-16 18:20:57,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:57,499 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-16 18:20:57,500 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-16 18:20:57,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 18:20:57,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 18:20:57,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:57,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:57,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 18:20:57,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 18:20:57,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 18:20:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889175264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:57,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:20:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-16 18:20:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902911414] [2025-03-16 18:20:57,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 18:20:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:57,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 18:20:57,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:20:57,929 INFO L87 Difference]: Start difference. First operand 192 states and 225 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-16 18:20:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:58,090 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2025-03-16 18:20:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:20:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 73 [2025-03-16 18:20:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:58,091 INFO L225 Difference]: With dead ends: 216 [2025-03-16 18:20:58,091 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 18:20:58,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:20:58,092 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:58,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 221 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 18:20:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2025-03-16 18:20:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 107 states have (on average 1.158878504672897) internal successors, (124), 110 states have internal predecessors, (124), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 18:20:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2025-03-16 18:20:58,112 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 73 [2025-03-16 18:20:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:58,112 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2025-03-16 18:20:58,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-16 18:20:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2025-03-16 18:20:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 18:20:58,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:58,113 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:58,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 18:20:58,317 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-16 18:20:58,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 948119273, now seen corresponding path program 1 times [2025-03-16 18:20:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663719236] [2025-03-16 18:20:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 18:20:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 18:20:58,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:58,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 18:20:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:58,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663719236] [2025-03-16 18:20:58,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663719236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:58,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164197883] [2025-03-16 18:20:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:58,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:58,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:58,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-16 18:20:58,412 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-16 18:20:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 18:20:58,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 18:20:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:58,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:20:58,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 18:20:58,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 18:20:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164197883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:58,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:20:58,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-03-16 18:20:58,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084690196] [2025-03-16 18:20:58,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:58,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:20:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:58,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:20:58,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:20:58,586 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-16 18:20:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:58,670 INFO L93 Difference]: Finished difference Result 217 states and 263 transitions. [2025-03-16 18:20:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:20:58,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 86 [2025-03-16 18:20:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:58,672 INFO L225 Difference]: With dead ends: 217 [2025-03-16 18:20:58,672 INFO L226 Difference]: Without dead ends: 161 [2025-03-16 18:20:58,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:20:58,673 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 124 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:20:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-16 18:20:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-16 18:20:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 112 states have internal predecessors, (126), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 18:20:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2025-03-16 18:20:58,693 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 86 [2025-03-16 18:20:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2025-03-16 18:20:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-16 18:20:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2025-03-16 18:20:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:20:58,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:58,694 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-16 18:20:58,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 18:20:58,895 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-16 18:20:58,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2066108769, now seen corresponding path program 2 times [2025-03-16 18:20:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696374726] [2025-03-16 18:20:58,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:20:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:58,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-16 18:20:58,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:20:58,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:20:58,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 18:20:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:20:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696374726] [2025-03-16 18:20:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696374726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:20:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250830000] [2025-03-16 18:20:59,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:20:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:59,026 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-16 18:20:59,027 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-16 18:20:59,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-16 18:20:59,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:20:59,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:20:59,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:59,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:20:59,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 18:20:59,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:20:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 18:20:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250830000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:20:59,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:20:59,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 9 [2025-03-16 18:20:59,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78772477] [2025-03-16 18:20:59,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:20:59,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:20:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:20:59,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:20:59,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:20:59,227 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-16 18:20:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:20:59,321 INFO L93 Difference]: Finished difference Result 208 states and 245 transitions. [2025-03-16 18:20:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 18:20:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 89 [2025-03-16 18:20:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:20:59,323 INFO L225 Difference]: With dead ends: 208 [2025-03-16 18:20:59,323 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 18:20:59,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:20:59,323 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 47 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:20:59,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 190 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:20:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 18:20:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2025-03-16 18:20:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 97 states have (on average 1.0824742268041236) internal successors, (105), 100 states have internal predecessors, (105), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-16 18:20:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2025-03-16 18:20:59,343 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 89 [2025-03-16 18:20:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:20:59,343 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2025-03-16 18:20:59,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-16 18:20:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2025-03-16 18:20:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:20:59,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:20:59,344 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 18:20:59,350 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-16 18:20:59,544 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-16 18:20:59,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:20:59,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:20:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2066913126, now seen corresponding path program 1 times [2025-03-16 18:20:59,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:20:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408777583] [2025-03-16 18:20:59,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:59,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:20:59,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:20:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:20:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:20:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796211074] [2025-03-16 18:20:59,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:20:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:20:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:20:59,583 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:20:59,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 18:20:59,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:20:59,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:20:59,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:20:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:20:59,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-16 18:20:59,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:20:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-16 18:20:59,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:21:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-16 18:21:08,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:21:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408777583] [2025-03-16 18:21:08,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:21:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796211074] [2025-03-16 18:21:08,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796211074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:21:08,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:21:08,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-03-16 18:21:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397454975] [2025-03-16 18:21:08,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:21:08,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 18:21:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:21:08,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 18:21:08,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:21:08,490 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-16 18:21:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:21:09,617 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2025-03-16 18:21:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 18:21:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 89 [2025-03-16 18:21:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:21:09,619 INFO L225 Difference]: With dead ends: 180 [2025-03-16 18:21:09,619 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 18:21:09,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-03-16 18:21:09,620 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:21:09,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 562 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 18:21:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 18:21:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2025-03-16 18:21:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 100 states have (on average 1.08) internal successors, (108), 103 states have internal predecessors, (108), 25 states have call successors, (25), 21 states have call predecessors, (25), 21 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 18:21:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2025-03-16 18:21:09,642 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 89 [2025-03-16 18:21:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:21:09,643 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2025-03-16 18:21:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-16 18:21:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2025-03-16 18:21:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:21:09,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:21:09,643 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:21:09,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 18:21:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 18:21:09,847 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:21:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:21:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash -249135702, now seen corresponding path program 2 times [2025-03-16 18:21:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:21:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741246691] [2025-03-16 18:21:09,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:21:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:21:09,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-16 18:21:09,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:21:09,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:21:09,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:21:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448942206] [2025-03-16 18:21:09,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:21:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:21:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:21:09,867 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:21:09,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 18:21:09,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-16 18:21:09,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:21:09,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:21:09,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:21:09,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 18:21:09,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:21:09,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:21:09,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:21:09,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:21:09,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 18:21:09,954 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 18:21:09,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:21:09,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 18:21:10,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 18:21:10,160 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:21:10,197 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:21:10,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:21:10 BoogieIcfgContainer [2025-03-16 18:21:10,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:21:10,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:21:10,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:21:10,200 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:21:10,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:20:49" (3/4) ... [2025-03-16 18:21:10,201 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 18:21:10,251 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 63. [2025-03-16 18:21:10,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:21:10,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:21:10,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:21:10,302 INFO L158 Benchmark]: Toolchain (without parser) took 20915.33ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 113.2MB in the beginning and 216.8MB in the end (delta: -103.6MB). Peak memory consumption was 271.9MB. Max. memory is 16.1GB. [2025-03-16 18:21:10,302 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:21:10,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.62ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:21:10,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.6MB in the end (delta: 902.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:21:10,306 INFO L158 Benchmark]: Boogie Preprocessor took 29.86ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:21:10,306 INFO L158 Benchmark]: IcfgBuilder took 212.25ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 87.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:21:10,306 INFO L158 Benchmark]: TraceAbstraction took 20381.81ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 87.1MB in the beginning and 225.2MB in the end (delta: -138.1MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. [2025-03-16 18:21:10,306 INFO L158 Benchmark]: Witness Printer took 101.13ms. Allocated memory is still 520.1MB. Free memory was 225.2MB in the beginning and 216.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:21:10,307 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.87ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.62ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.6MB in the end (delta: 902.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.86ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.25ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 87.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20381.81ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 87.1MB in the beginning and 225.2MB in the end (delta: -138.1MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. * Witness Printer took 101.13ms. Allocated memory is still 520.1MB. Free memory was 225.2MB in the beginning and 216.8MB in the end (delta: 8.4MB). 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=7, B=1, counter=0, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=1, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=2, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=3, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L38] COND TRUE !(r >= d) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(d == B*p) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [A=7, B=1, counter=5, d=4, p=4, q=0, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [A=7, B=1, counter=5, d=4, p=4, q=4, r=3] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=6, d=4, p=4, q=4, r=3] [L44] COND FALSE !(counter++<5) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 44 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 2499 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1984 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1619 IncrementalHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 515 mSDtfsCounter, 1619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1284 GetRequests, 1120 SyntacticMatches, 18 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=10, InterpolantAutomatonStates: 138, 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, 15 MinimizatonAttempts, 127 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1588 ConstructedInterpolants, 0 QuantifiedInterpolants, 16907 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1817 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 4343/5079 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-16 18:21:10,331 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