./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.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 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:53:01,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:53:01,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:53:01,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:53:01,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:53:01,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:53:01,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:53:01,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:53:01,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:53:01,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:53:01,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:53:01,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:53:01,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:53:01,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:53:01,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:53:01,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:53:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:53:01,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:53:01,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:53:01,516 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 -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2025-03-03 13:53:01,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:53:01,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:53:01,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:53:01,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:53:01,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:53:01,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2025-03-03 13:53:02,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324f0bc26/acdc86c530b3409f86e4571f9097d26c/FLAG119bb8791 [2025-03-03 13:53:03,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:53:03,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2025-03-03 13:53:03,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324f0bc26/acdc86c530b3409f86e4571f9097d26c/FLAG119bb8791 [2025-03-03 13:53:03,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324f0bc26/acdc86c530b3409f86e4571f9097d26c [2025-03-03 13:53:03,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:53:03,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:53:03,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:53:03,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:53:03,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:53:03,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67eaf03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03, skipping insertion in model container [2025-03-03 13:53:03,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:53:03,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2025-03-03 13:53:03,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:53:03,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:53:03,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2025-03-03 13:53:03,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:53:03,707 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:53:03,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03 WrapperNode [2025-03-03 13:53:03,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:53:03,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:53:03,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:53:03,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:53:03,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,732 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-03-03 13:53:03,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:53:03,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:53:03,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:53:03,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:53:03,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:53:03,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:53:03,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:53:03,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:53:03,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:53:03,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (1/1) ... [2025-03-03 13:53:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:53:03,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:03,796 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-03 13:53:03,798 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-03 13:53:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:53:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:53:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:53:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:53:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:53:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:53:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:53:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:53:03,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:53:03,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:53:03,984 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:53:03,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:53:03,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:53:03,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:53:03,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:03 BoogieIcfgContainer [2025-03-03 13:53:03,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:53:03,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:53:03,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:53:03,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:53:03,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:53:03" (1/3) ... [2025-03-03 13:53:03,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef41e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:53:03, skipping insertion in model container [2025-03-03 13:53:03,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:03" (2/3) ... [2025-03-03 13:53:03,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef41e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:53:03, skipping insertion in model container [2025-03-03 13:53:03,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:03" (3/3) ... [2025-03-03 13:53:04,000 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2025-03-03 13:53:04,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:53:04,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound20.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:53:04,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:53:04,060 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;@2aaed2b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:53:04,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:53:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:53:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:53:04,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:04,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:04,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash -758256744, now seen corresponding path program 1 times [2025-03-03 13:53:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358887186] [2025-03-03 13:53:04,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:04,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:53:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:53:04,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:04,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:53:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358887186] [2025-03-03 13:53:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358887186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879570214] [2025-03-03 13:53:04,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:04,174 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-03 13:53:04,175 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-03 13:53:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:53:04,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:53:04,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:04,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:04,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:53:04,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:53:04,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:53:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879570214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:53:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:53:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130533711] [2025-03-03 13:53:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:53:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:04,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:53:04,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:53:04,268 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:53:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:04,286 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-03-03 13:53:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:53:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-03 13:53:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:04,292 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:53:04,292 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:53:04,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:53:04,298 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:04,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:53:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 13:53:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:53:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-03 13:53:04,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-03-03 13:53:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:04,325 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-03 13:53:04,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:53:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-03 13:53:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:53:04,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:04,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:04,333 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-03 13:53:04,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:53:04,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -766943530, now seen corresponding path program 1 times [2025-03-03 13:53:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512215768] [2025-03-03 13:53:04,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:04,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:04,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:53:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394526991] [2025-03-03 13:53:04,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:04,559 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-03 13:53:04,559 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-03 13:53:04,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:04,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:04,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:04,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:04,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:53:04,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:04,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:53:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512215768] [2025-03-03 13:53:04,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:53:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394526991] [2025-03-03 13:53:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394526991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:04,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:04,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:53:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075493962] [2025-03-03 13:53:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:04,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:53:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:04,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:53:04,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:04,800 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:06,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:53:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:06,528 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-03-03 13:53:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:53:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:53:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:06,529 INFO L225 Difference]: With dead ends: 47 [2025-03-03 13:53:06,529 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 13:53:06,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:53:06,530 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:06,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 13:53:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 13:53:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-03 13:53:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:53:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-03-03 13:53:06,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-03-03 13:53:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:06,542 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-03-03 13:53:06,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-03-03 13:53:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:53:06,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:06,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:06,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 13:53:06,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -766198755, now seen corresponding path program 1 times [2025-03-03 13:53:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395828091] [2025-03-03 13:53:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:06,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:06,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:06,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:06,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:06,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395828091] [2025-03-03 13:53:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395828091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:53:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023850630] [2025-03-03 13:53:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:53:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:53:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:06,832 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:06,852 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-03-03 13:53:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:53:06,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:53:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:06,854 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:53:06,854 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 13:53:06,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:06,854 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:06,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 13:53:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 13:53:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:53:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-03-03 13:53:06,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-03-03 13:53:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:06,869 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-03 13:53:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-03-03 13:53:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:53:06,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:06,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:06,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:53:06,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1891524392, now seen corresponding path program 1 times [2025-03-03 13:53:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:06,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899329625] [2025-03-03 13:53:06,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:06,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:53:06,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:53:06,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:06,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899329625] [2025-03-03 13:53:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899329625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307723844] [2025-03-03 13:53:07,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:07,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:07,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:07,098 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-03 13:53:07,099 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-03 13:53:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:53:07,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:53:07,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:07,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:53:07,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:07,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:07,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307723844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:07,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:07,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-03 13:53:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058481166] [2025-03-03 13:53:07,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:07,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:53:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:07,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:53:07,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:53:07,271 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:53:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:07,352 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-03 13:53:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:53:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2025-03-03 13:53:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:07,353 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:53:07,353 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:53:07,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:53:07,354 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:07,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:53:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-03-03 13:53:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:53:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-03 13:53:07,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-03-03 13:53:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-03 13:53:07,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:53:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-03 13:53:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:53:07,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:07,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:07,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:07,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:07,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:07,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2058223402, now seen corresponding path program 1 times [2025-03-03 13:53:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957803057] [2025-03-03 13:53:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:07,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 13:53:07,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:53:07,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:07,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,640 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-03 13:53:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957803057] [2025-03-03 13:53:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957803057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:07,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:07,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:53:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244208858] [2025-03-03 13:53:07,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:07,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:53:07,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:07,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:53:07,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:07,641 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:53:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:07,683 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-03-03 13:53:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:53:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-03 13:53:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:07,686 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:53:07,688 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:53:07,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:07,689 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:07,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:53:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 13:53:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:53:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-03 13:53:07,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2025-03-03 13:53:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-03 13:53:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:53:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-03 13:53:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:53:07,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:07,698 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:53:07,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:07,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1717573043, now seen corresponding path program 1 times [2025-03-03 13:53:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401656603] [2025-03-03 13:53:07,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:53:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:53:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:07,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401656603] [2025-03-03 13:53:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401656603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:07,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:07,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:53:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483715231] [2025-03-03 13:53:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:53:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:07,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:53:07,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:53:07,777 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:53:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:07,818 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-03-03 13:53:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:53:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-03-03 13:53:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:07,822 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:53:07,822 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 13:53:07,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:53:07,823 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:07,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 13:53:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-03 13:53:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:53:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-03 13:53:07,838 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2025-03-03 13:53:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:07,838 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-03 13:53:07,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:53:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-03 13:53:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:53:07,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:07,839 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:07,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:53:07,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:07,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1141283122, now seen corresponding path program 1 times [2025-03-03 13:53:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620421498] [2025-03-03 13:53:07,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:07,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:53:07,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:53:07,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:07,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620421498] [2025-03-03 13:53:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620421498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838455957] [2025-03-03 13:53:07,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:07,928 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-03 13:53:07,929 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-03 13:53:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:53:07,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:53:07,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:07,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:07,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:53:07,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:08,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838455957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:08,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-03 13:53:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742123426] [2025-03-03 13:53:08,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:08,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:53:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:08,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:53:08,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:53:08,083 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 13:53:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:08,209 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-03-03 13:53:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:53:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2025-03-03 13:53:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:08,214 INFO L225 Difference]: With dead ends: 125 [2025-03-03 13:53:08,215 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 13:53:08,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:53:08,216 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:08,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 141 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 13:53:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-03-03 13:53:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:53:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-03-03 13:53:08,244 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2025-03-03 13:53:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:08,244 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-03 13:53:08,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 13:53:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2025-03-03 13:53:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:53:08,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:08,246 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:08,251 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-03 13:53:08,450 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-03 13:53:08,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:08,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 318935871, now seen corresponding path program 1 times [2025-03-03 13:53:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:08,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002532163] [2025-03-03 13:53:08,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:08,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:53:08,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:53:08,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:08,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002532163] [2025-03-03 13:53:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002532163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:53:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260823550] [2025-03-03 13:53:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:08,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:53:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:08,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:53:08,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:08,497 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:53:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:08,539 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2025-03-03 13:53:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:53:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-03-03 13:53:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:08,541 INFO L225 Difference]: With dead ends: 154 [2025-03-03 13:53:08,541 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 13:53:08,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:08,542 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:08,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 13:53:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-03-03 13:53:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 13:53:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-03-03 13:53:08,567 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2025-03-03 13:53:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:08,568 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-03-03 13:53:08,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:53:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-03-03 13:53:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:53:08,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:08,572 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:08,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:53:08,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 191952453, now seen corresponding path program 1 times [2025-03-03 13:53:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363965265] [2025-03-03 13:53:08,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:08,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:53:08,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:53:08,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363965265] [2025-03-03 13:53:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363965265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615693869] [2025-03-03 13:53:08,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:08,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:08,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:08,660 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-03 13:53:08,662 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-03 13:53:08,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:53:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:53:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:08,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:53:08,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:08,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615693869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:08,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-03-03 13:53:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388349206] [2025-03-03 13:53:08,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:08,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:53:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:08,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:53:08,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:53:08,824 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:53:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:09,009 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-03-03 13:53:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:53:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2025-03-03 13:53:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:09,011 INFO L225 Difference]: With dead ends: 215 [2025-03-03 13:53:09,011 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 13:53:09,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:53:09,012 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:09,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 13:53:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-03-03 13:53:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 13:53:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-03-03 13:53:09,053 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2025-03-03 13:53:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:09,053 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-03-03 13:53:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:53:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-03-03 13:53:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 13:53:09,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:09,054 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:09,060 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-03 13:53:09,254 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-03 13:53:09,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:09,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1202242871, now seen corresponding path program 1 times [2025-03-03 13:53:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:09,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094011895] [2025-03-03 13:53:09,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:09,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:53:09,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:53:09,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:53:09,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094011895] [2025-03-03 13:53:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094011895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277819136] [2025-03-03 13:53:09,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:09,337 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-03 13:53:09,338 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-03 13:53:09,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:53:09,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:53:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:09,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:53:09,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:09,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:53:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277819136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:09,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-03 13:53:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519083297] [2025-03-03 13:53:09,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:53:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:09,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:53:09,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:53:09,518 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-03 13:53:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:09,736 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-03-03 13:53:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:53:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2025-03-03 13:53:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:09,738 INFO L225 Difference]: With dead ends: 207 [2025-03-03 13:53:09,738 INFO L226 Difference]: Without dead ends: 202 [2025-03-03 13:53:09,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:53:09,738 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 143 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:09,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 171 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-03 13:53:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-03-03 13:53:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 13:53:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-03-03 13:53:09,782 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2025-03-03 13:53:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:09,782 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-03-03 13:53:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-03 13:53:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-03-03 13:53:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 13:53:09,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:09,785 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:09,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:53:09,986 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-03 13:53:09,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:09,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -760810850, now seen corresponding path program 2 times [2025-03-03 13:53:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530517393] [2025-03-03 13:53:09,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:09,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-03 13:53:10,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:53:10,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:53:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530517393] [2025-03-03 13:53:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530517393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969401064] [2025-03-03 13:53:10,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:10,229 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-03 13:53:10,231 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-03 13:53:10,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-03 13:53:10,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:53:10,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:10,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:10,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:53:10,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:10,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:53:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969401064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:10,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:10,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-03 13:53:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724811867] [2025-03-03 13:53:10,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:10,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:53:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:10,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:53:10,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:53:10,593 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 13:53:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:11,144 INFO L93 Difference]: Finished difference Result 549 states and 749 transitions. [2025-03-03 13:53:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 13:53:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) Word has length 87 [2025-03-03 13:53:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:11,147 INFO L225 Difference]: With dead ends: 549 [2025-03-03 13:53:11,147 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 13:53:11,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=507, Invalid=899, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:53:11,148 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 364 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:11,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 318 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 13:53:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 449. [2025-03-03 13:53:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 339 states have internal predecessors, (419), 93 states have call successors, (93), 20 states have call predecessors, (93), 19 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 13:53:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 604 transitions. [2025-03-03 13:53:11,259 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 604 transitions. Word has length 87 [2025-03-03 13:53:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:11,260 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 604 transitions. [2025-03-03 13:53:11,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 13:53:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 604 transitions. [2025-03-03 13:53:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 13:53:11,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:11,262 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:11,269 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-03 13:53:11,462 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-03 13:53:11,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1449499115, now seen corresponding path program 2 times [2025-03-03 13:53:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:11,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048477431] [2025-03-03 13:53:11,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:11,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:53:11,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:53:11,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 13:53:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048477431] [2025-03-03 13:53:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048477431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051041623] [2025-03-03 13:53:11,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:11,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:11,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:11,739 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-03 13:53:11,741 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-03 13:53:11,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:53:11,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:53:11,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:11,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:11,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:53:11,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:11,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 13:53:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051041623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:12,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2025-03-03 13:53:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225464692] [2025-03-03 13:53:12,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:12,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:53:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:12,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:53:12,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:53:12,113 INFO L87 Difference]: Start difference. First operand 449 states and 604 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-03 13:53:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:12,698 INFO L93 Difference]: Finished difference Result 746 states and 991 transitions. [2025-03-03 13:53:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 13:53:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 93 [2025-03-03 13:53:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:12,701 INFO L225 Difference]: With dead ends: 746 [2025-03-03 13:53:12,701 INFO L226 Difference]: Without dead ends: 486 [2025-03-03 13:53:12,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:53:12,705 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 456 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:12,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 337 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-03 13:53:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 437. [2025-03-03 13:53:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 327 states have (on average 1.2110091743119267) internal successors, (396), 328 states have internal predecessors, (396), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 13:53:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 571 transitions. [2025-03-03 13:53:12,789 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 571 transitions. Word has length 93 [2025-03-03 13:53:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 571 transitions. [2025-03-03 13:53:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-03 13:53:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 571 transitions. [2025-03-03 13:53:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 13:53:12,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:12,790 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:12,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:12,994 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-03 13:53:12,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1311565561, now seen corresponding path program 2 times [2025-03-03 13:53:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880463351] [2025-03-03 13:53:12,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:12,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-03 13:53:13,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:53:13,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:13,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 13:53:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880463351] [2025-03-03 13:53:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880463351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941457049] [2025-03-03 13:53:13,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:13,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:13,213 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-03 13:53:13,215 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-03 13:53:13,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-03 13:53:13,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:53:13,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:13,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:13,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:53:13,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:13,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 13:53:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941457049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:13,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 24 [2025-03-03 13:53:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175503231] [2025-03-03 13:53:13,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:13,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:53:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:13,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:53:13,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:53:13,600 INFO L87 Difference]: Start difference. First operand 437 states and 571 transitions. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2025-03-03 13:53:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:14,143 INFO L93 Difference]: Finished difference Result 447 states and 581 transitions. [2025-03-03 13:53:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 13:53:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) Word has length 99 [2025-03-03 13:53:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:14,145 INFO L225 Difference]: With dead ends: 447 [2025-03-03 13:53:14,145 INFO L226 Difference]: Without dead ends: 442 [2025-03-03 13:53:14,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=551, Invalid=1009, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 13:53:14,147 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 340 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:14,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 309 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-03 13:53:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 439. [2025-03-03 13:53:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 329 states have (on average 1.182370820668693) internal successors, (389), 330 states have internal predecessors, (389), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 13:53:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 564 transitions. [2025-03-03 13:53:14,209 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 564 transitions. Word has length 99 [2025-03-03 13:53:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:14,209 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 564 transitions. [2025-03-03 13:53:14,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2025-03-03 13:53:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 564 transitions. [2025-03-03 13:53:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 13:53:14,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:14,212 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 19, 18, 17, 17, 17, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:14,218 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-03 13:53:14,416 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-03 13:53:14,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:14,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1276384640, now seen corresponding path program 1 times [2025-03-03 13:53:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122667336] [2025-03-03 13:53:14,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:14,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 13:53:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 13:53:14,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 40 proven. 578 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-03 13:53:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122667336] [2025-03-03 13:53:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122667336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820371559] [2025-03-03 13:53:14,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:14,948 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-03 13:53:14,949 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-03 13:53:14,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 13:53:15,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 13:53:15,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:15,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:15,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:53:15,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 110 proven. 1190 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:53:15,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 40 proven. 578 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-03 13:53:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820371559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:15,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 24 [2025-03-03 13:53:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485427750] [2025-03-03 13:53:15,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:53:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:15,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:53:15,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:53:15,506 INFO L87 Difference]: Start difference. First operand 439 states and 564 transitions. Second operand has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 21 states have call successors, (47), 21 states have call predecessors, (47), 21 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) [2025-03-03 13:53:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:16,042 INFO L93 Difference]: Finished difference Result 483 states and 625 transitions. [2025-03-03 13:53:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 13:53:16,043 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 21 states have call successors, (47), 21 states have call predecessors, (47), 21 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) Word has length 173 [2025-03-03 13:53:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:16,045 INFO L225 Difference]: With dead ends: 483 [2025-03-03 13:53:16,045 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 13:53:16,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 326 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 13:53:16,046 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 290 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:16,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 314 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 13:53:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-03 13:53:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 334 states have (on average 1.1736526946107784) internal successors, (392), 334 states have internal predecessors, (392), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 13:53:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 567 transitions. [2025-03-03 13:53:16,122 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 567 transitions. Word has length 173 [2025-03-03 13:53:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:16,122 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 567 transitions. [2025-03-03 13:53:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 21 states have call successors, (47), 21 states have call predecessors, (47), 21 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) [2025-03-03 13:53:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 567 transitions. [2025-03-03 13:53:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 13:53:16,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:16,126 INFO L218 NwaCegarLoop]: trace histogram [21, 20, 20, 18, 18, 18, 18, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:16,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:53:16,330 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-03 13:53:16,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:16,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1986274487, now seen corresponding path program 3 times [2025-03-03 13:53:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275165187] [2025-03-03 13:53:16,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:16,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 179 statements into 21 equivalence classes. [2025-03-03 13:53:16,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 179 statements. [2025-03-03 13:53:16,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:53:16,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2025-03-03 13:53:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275165187] [2025-03-03 13:53:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275165187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893784145] [2025-03-03 13:53:16,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:16,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:16,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:16,430 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-03 13:53:16,431 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-03 13:53:16,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 179 statements into 21 equivalence classes. [2025-03-03 13:53:16,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 179 statements. [2025-03-03 13:53:16,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:53:16,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:16,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:53:16,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2025-03-03 13:53:16,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893784145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:18,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:53:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2025-03-03 13:53:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618516458] [2025-03-03 13:53:18,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:53:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:18,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:53:18,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 [2025-03-03 13:53:18,244 INFO L87 Difference]: Start difference. First operand 444 states and 567 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:53:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:18,430 INFO L93 Difference]: Finished difference Result 1024 states and 1299 transitions. [2025-03-03 13:53:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:53:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 179 [2025-03-03 13:53:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:18,433 INFO L225 Difference]: With dead ends: 1024 [2025-03-03 13:53:18,433 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 13:53:18,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=48, Invalid=161, Unknown=1, NotChecked=0, Total=210 [2025-03-03 13:53:18,435 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:18,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 269 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 13:53:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 404. [2025-03-03 13:53:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 303 states have (on average 1.1452145214521452) internal successors, (347), 305 states have internal predecessors, (347), 78 states have call successors, (78), 23 states have call predecessors, (78), 22 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-03 13:53:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 502 transitions. [2025-03-03 13:53:18,482 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 502 transitions. Word has length 179 [2025-03-03 13:53:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 502 transitions. [2025-03-03 13:53:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:53:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 502 transitions. [2025-03-03 13:53:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 13:53:18,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:18,484 INFO L218 NwaCegarLoop]: trace histogram [21, 20, 20, 17, 17, 17, 17, 16, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:18,490 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-03 13:53:18,688 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-03 13:53:18,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:18,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1366986542, now seen corresponding path program 1 times [2025-03-03 13:53:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:18,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730355117] [2025-03-03 13:53:18,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:18,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 13:53:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 13:53:18,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:18,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:53:18,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729696557] [2025-03-03 13:53:18,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:18,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:18,745 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-03 13:53:18,747 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-03 13:53:18,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 13:53:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 13:53:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:53:18,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:53:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 13:53:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 13:53:18,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:18,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:53:18,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:53:18,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:53:18,914 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:53:18,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:19,115 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-03 13:53:19,117 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:19,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:53:19,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:53:19 BoogieIcfgContainer [2025-03-03 13:53:19,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:53:19,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:53:19,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:53:19,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:53:19,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:03" (3/4) ... [2025-03-03 13:53:19,169 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:53:19,223 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 131. [2025-03-03 13:53:19,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:53:19,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:53:19,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:53:19,294 INFO L158 Benchmark]: Toolchain (without parser) took 15761.66ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 134.4MB in the beginning and 235.5MB in the end (delta: -101.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.33ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 123.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.89ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: Boogie Preprocessor took 34.42ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.9MB in the end (delta: 935.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: IcfgBuilder took 223.72ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: TraceAbstraction took 15172.91ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 107.4MB in the beginning and 247.8MB in the end (delta: -140.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:53:19,294 INFO L158 Benchmark]: Witness Printer took 125.36ms. Allocated memory is still 293.6MB. Free memory was 247.8MB in the beginning and 235.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:53:19,295 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.33ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 123.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.89ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.42ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.9MB in the end (delta: 935.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 223.72ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15172.91ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 107.4MB in the beginning and 247.8MB in the end (delta: -140.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 125.36ms. Allocated memory is still 293.6MB. Free memory was 247.8MB in the beginning and 235.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=13463, R=117, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=13463, R=117, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=13463, counter=0, r=226, u=235, v=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [A=13463, counter=1, r=226, u=235, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=1, r=226, u=235, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=13463, counter=1, r=226, u=235, v=1] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=2, r=226, u=235, v=1] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=2, r=226, u=235, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=2, r=225, u=235, v=3] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=3, r=225, u=235, v=3] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=3, r=225, u=235, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=3, r=222, u=235, v=5] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=4, r=222, u=235, v=5] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=4, r=222, u=235, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=4, r=217, u=235, v=7] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=5, r=217, u=235, v=7] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=5, r=217, u=235, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=5, r=210, u=235, v=9] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=6, r=210, u=235, v=9] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=6, r=210, u=235, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=6, r=201, u=235, v=11] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=7, r=201, u=235, v=11] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=7, r=201, u=235, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=7, r=190, u=235, v=13] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=8, r=190, u=235, v=13] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=8, r=190, u=235, v=13] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=8, r=177, u=235, v=15] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=9, r=177, u=235, v=15] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=9, r=177, u=235, v=15] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=9, r=162, u=235, v=17] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=10, r=162, u=235, v=17] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=10, r=162, u=235, v=17] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=10, r=145, u=235, v=19] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=11, r=145, u=235, v=19] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=11, r=145, u=235, v=19] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=11, r=126, u=235, v=21] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=12, r=126, u=235, v=21] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=12, r=126, u=235, v=21] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=12, r=105, u=235, v=23] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=13, r=105, u=235, v=23] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=13, r=105, u=235, v=23] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=13, r=82, u=235, v=25] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=14, r=82, u=235, v=25] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=14, r=82, u=235, v=25] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=14, r=57, u=235, v=27] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=15, r=57, u=235, v=27] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=15, r=57, u=235, v=27] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=15, r=30, u=235, v=29] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=16, r=30, u=235, v=29] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=16, r=30, u=235, v=29] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=16, r=1, u=235, v=31] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=17, r=1, u=235, v=31] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=17, r=1, u=235, v=31] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13463, counter=17, r=-30, u=235, v=33] [L39] COND TRUE counter++<20 [L39] EXPR counter++ VAL [A=13463, counter=18, r=-30, u=235, v=33] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=18, r=-30, u=235, v=33] [L41] COND TRUE !(r > 0) VAL [A=13463, counter=18, r=-30, u=235, v=33] [L47] COND TRUE counter++<20 [L47] EXPR counter++ VAL [A=13463, counter=19, r=-30, u=235, v=33] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=19, r=-30, u=235, v=33] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=13463, counter=19, r=205, u=237, v=33] [L47] COND TRUE counter++<20 [L47] EXPR counter++ VAL [A=13463, counter=20, r=205, u=237, v=33] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13463, counter=20, r=205, u=237, v=33] [L49] COND TRUE !(r < 0) VAL [A=13463, counter=20, r=205, u=237, v=33] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [A=13463, counter=21, r=205, u=237, v=33] [L34] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1866 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1856 mSDsluCounter, 2659 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2153 mSDsCounter, 762 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1314 IncrementalHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 762 mSolverCounterUnsat, 506 mSDtfsCounter, 1314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1637 GetRequests, 1376 SyntacticMatches, 24 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=11, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 298 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2144 NumberOfCodeBlocks, 1856 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2346 ConstructedInterpolants, 0 QuantifiedInterpolants, 5060 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1776 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 5745/9582 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-03 13:53:19,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE