./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-examples/relax-2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/array-examples/relax-2-2.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 78a11ab4a8f9b0ddb7197affe01383a32397a50731b3a1516a7f7401435cafd7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:29,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:29,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:50:29,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:29,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:29,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:29,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:29,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:29,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:29,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:29,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:29,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:29,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:29,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:29,888 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:29,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:29,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:29,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:29,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:29,891 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 -> 78a11ab4a8f9b0ddb7197affe01383a32397a50731b3a1516a7f7401435cafd7 [2025-04-29 10:50:30,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:30,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:30,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:30,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:30,126 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:30,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2-2.c [2025-04-29 10:50:31,460 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8fc9995/921d298d41cf45e0ac90387ab60f05ab/FLAGade681497 [2025-04-29 10:50:31,663 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:31,663 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.c [2025-04-29 10:50:31,664 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:31,664 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:31,668 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8fc9995/921d298d41cf45e0ac90387ab60f05ab/FLAGade681497 [2025-04-29 10:50:32,661 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8fc9995/921d298d41cf45e0ac90387ab60f05ab [2025-04-29 10:50:32,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:32,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:32,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:32,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:32,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667df43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32, skipping insertion in model container [2025-04-29 10:50:32,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:32,814 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.c[2546,2559] [2025-04-29 10:50:32,839 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,845 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:32,864 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.c[2546,2559] [2025-04-29 10:50:32,878 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,891 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:32,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32 WrapperNode [2025-04-29 10:50:32,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:32,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:32,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,924 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2025-04-29 10:50:32,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:32,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:32,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,948 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [6, 6]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-04-29 10:50:32,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:32,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:32,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:32,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:32,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:32,984 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-04-29 10:50:32,987 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-04-29 10:50:33,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-04-29 10:50:33,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:33,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:50:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 10:50:33,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 10:50:33,067 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:33,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:33,263 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:33,264 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:33,273 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:33,273 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:33,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:33 BoogieIcfgContainer [2025-04-29 10:50:33,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:33,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:33,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:33,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:33,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:50:32" (1/3) ... [2025-04-29 10:50:33,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe53656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:33, skipping insertion in model container [2025-04-29 10:50:33,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (2/3) ... [2025-04-29 10:50:33,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe53656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:33, skipping insertion in model container [2025-04-29 10:50:33,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:33" (3/3) ... [2025-04-29 10:50:33,283 INFO L128 eAbstractionObserver]: Analyzing ICFG relax-2-2.c [2025-04-29 10:50:33,296 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:33,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG relax-2-2.c that has 3 procedures, 48 locations, 78 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-29 10:50:33,338 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:33,348 INFO L340 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;@4901aab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:33,349 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:33,351 INFO L278 IsEmpty]: Start isEmpty. Operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:33,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:50:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:33,358 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1112410150, now seen corresponding path program 1 times [2025-04-29 10:50:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833587209] [2025-04-29 10:50:33,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:50:33,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:50:33,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:50:33,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833587209] [2025-04-29 10:50:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833587209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:33,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465396320] [2025-04-29 10:50:33,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:33,476 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-04-29 10:50:33,477 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-04-29 10:50:33,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:50:33,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:50:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-29 10:50:33,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:50:33,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465396320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:33,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-04-29 10:50:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436202962] [2025-04-29 10:50:33,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:50:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:50:33,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:50:33,586 INFO L87 Difference]: Start difference. First operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-04-29 10:50:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,603 INFO L93 Difference]: Finished difference Result 93 states and 145 transitions. [2025-04-29 10:50:33,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:50:33,604 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 22 [2025-04-29 10:50:33,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,608 INFO L225 Difference]: With dead ends: 93 [2025-04-29 10:50:33,608 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 10:50:33,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-04-29 10:50:33,612 INFO L437 NwaCegarLoop]: 69 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, 69 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-04-29 10:50:33,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 10:50:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 10:50:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 37 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-04-29 10:50:33,640 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 22 [2025-04-29 10:50:33,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,640 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-04-29 10:50:33,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-04-29 10:50:33,641 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2025-04-29 10:50:33,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:50:33,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:33,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:50:33,846 WARN L466 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-04-29 10:50:33,846 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1468540570, now seen corresponding path program 1 times [2025-04-29 10:50:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652190656] [2025-04-29 10:50:33,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:50:33,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:50:33,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652190656] [2025-04-29 10:50:34,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652190656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051496487] [2025-04-29 10:50:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:34,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:34,085 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-04-29 10:50:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,112 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2025-04-29 10:50:34,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,112 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2025-04-29 10:50:34,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,115 INFO L225 Difference]: With dead ends: 67 [2025-04-29 10:50:34,115 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 10:50:34,116 INFO L436 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-04-29 10:50:34,116 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 10:50:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-29 10:50:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 39 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-04-29 10:50:34,123 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2025-04-29 10:50:34,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,124 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-04-29 10:50:34,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-04-29 10:50:34,126 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-04-29 10:50:34,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:50:34,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:50:34,127 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 208965837, now seen corresponding path program 1 times [2025-04-29 10:50:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698392944] [2025-04-29 10:50:34,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:50:34,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:50:34,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:34,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698392944] [2025-04-29 10:50:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698392944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:50:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476587445] [2025-04-29 10:50:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:34,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:34,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,340 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-04-29 10:50:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,431 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2025-04-29 10:50:34,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:34,432 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 24 [2025-04-29 10:50:34,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,433 INFO L225 Difference]: With dead ends: 93 [2025-04-29 10:50:34,433 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 10:50:34,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:34,434 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 10:50:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-29 10:50:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 52 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-04-29 10:50:34,445 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 24 [2025-04-29 10:50:34,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,445 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-04-29 10:50:34,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-04-29 10:50:34,445 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-04-29 10:50:34,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:50:34,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:50:34,447 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1283453344, now seen corresponding path program 1 times [2025-04-29 10:50:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038614555] [2025-04-29 10:50:34,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:50:34,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:50:34,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038614555] [2025-04-29 10:50:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038614555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:34,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206186444] [2025-04-29 10:50:34,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:34,778 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-04-29 10:50:34,779 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-04-29 10:50:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:50:34,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:50:34,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:50:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:34,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206186444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-04-29 10:50:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036460789] [2025-04-29 10:50:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:34,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:34,918 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-04-29 10:50:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,008 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2025-04-29 10:50:35,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:50:35,008 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 25 [2025-04-29 10:50:35,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,009 INFO L225 Difference]: With dead ends: 72 [2025-04-29 10:50:35,009 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 10:50:35,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:35,009 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 193 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 10:50:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-04-29 10:50:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 55 states have internal predecessors, (74), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2025-04-29 10:50:35,022 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 25 [2025-04-29 10:50:35,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,022 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2025-04-29 10:50:35,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-04-29 10:50:35,023 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2025-04-29 10:50:35,023 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:50:35,023 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:50:35,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:50:35,224 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -308075661, now seen corresponding path program 1 times [2025-04-29 10:50:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603253741] [2025-04-29 10:50:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:50:35,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:50:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603253741] [2025-04-29 10:50:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603253741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558712127] [2025-04-29 10:50:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:35,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:35,331 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-04-29 10:50:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,391 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2025-04-29 10:50:35,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:35,392 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 25 [2025-04-29 10:50:35,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,394 INFO L225 Difference]: With dead ends: 76 [2025-04-29 10:50:35,394 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 10:50:35,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04-29 10:50:35,395 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 10:50:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-29 10:50:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2025-04-29 10:50:35,404 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 25 [2025-04-29 10:50:35,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,405 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2025-04-29 10:50:35,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-04-29 10:50:35,405 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2025-04-29 10:50:35,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 10:50:35,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:50:35,405 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 669722942, now seen corresponding path program 1 times [2025-04-29 10:50:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371013225] [2025-04-29 10:50:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 10:50:35,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 10:50:35,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371013225] [2025-04-29 10:50:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371013225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024611541] [2025-04-29 10:50:35,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:35,676 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-04-29 10:50:35,677 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-04-29 10:50:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 10:50:35,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 10:50:35,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 10:50:35,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024611541] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:35,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 17 [2025-04-29 10:50:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146920144] [2025-04-29 10:50:35,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:50:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:50:35,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:50:35,996 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,353 INFO L93 Difference]: Finished difference Result 139 states and 198 transitions. [2025-04-29 10:50:36,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:50:36,354 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-04-29 10:50:36,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,355 INFO L225 Difference]: With dead ends: 139 [2025-04-29 10:50:36,355 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 10:50:36,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:50:36,356 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 855 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 10:50:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2025-04-29 10:50:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 58 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2025-04-29 10:50:36,365 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 26 [2025-04-29 10:50:36,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,366 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2025-04-29 10:50:36,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:36,366 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2025-04-29 10:50:36,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:50:36,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,368 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, 1, 1] [2025-04-29 10:50:36,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:50:36,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:36,572 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,572 INFO L85 PathProgramCache]: Analyzing trace with hash 973966865, now seen corresponding path program 2 times [2025-04-29 10:50:36,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304443768] [2025-04-29 10:50:36,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 10:50:36,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 27 statements. [2025-04-29 10:50:36,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:50:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:50:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304443768] [2025-04-29 10:50:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304443768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:50:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156259255] [2025-04-29 10:50:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:36,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:36,732 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-04-29 10:50:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,808 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2025-04-29 10:50:36,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:36,809 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 27 [2025-04-29 10:50:36,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,810 INFO L225 Difference]: With dead ends: 83 [2025-04-29 10:50:36,810 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 10:50:36,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:36,810 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 177 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 10:50:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-04-29 10:50:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 64 states have internal predecessors, (83), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2025-04-29 10:50:36,822 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 27 [2025-04-29 10:50:36,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,823 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2025-04-29 10:50:36,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-04-29 10:50:36,823 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2025-04-29 10:50:36,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:50:36,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,825 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, 1, 1] [2025-04-29 10:50:36,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:50:36,825 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 975813907, now seen corresponding path program 1 times [2025-04-29 10:50:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459802229] [2025-04-29 10:50:36,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:50:36,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:50:36,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459802229] [2025-04-29 10:50:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459802229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122027934] [2025-04-29 10:50:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:36,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:36,926 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04-29 10:50:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,003 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2025-04-29 10:50:37,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:37,004 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 27 [2025-04-29 10:50:37,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,005 INFO L225 Difference]: With dead ends: 127 [2025-04-29 10:50:37,005 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 10:50:37,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:37,006 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 157 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 10:50:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-04-29 10:50:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 82 states have internal predecessors, (109), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2025-04-29 10:50:37,023 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 27 [2025-04-29 10:50:37,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,023 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2025-04-29 10:50:37,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-04-29 10:50:37,023 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2025-04-29 10:50:37,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:50:37,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,025 INFO L218 NwaCegarLoop]: trace histogram [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-04-29 10:50:37,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 10:50:37,025 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1954160980, now seen corresponding path program 1 times [2025-04-29 10:50:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036397687] [2025-04-29 10:50:37,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:50:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:50:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036397687] [2025-04-29 10:50:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036397687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:37,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127776313] [2025-04-29 10:50:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:37,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:37,081 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-04-29 10:50:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,100 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2025-04-29 10:50:37,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:37,101 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 27 [2025-04-29 10:50:37,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,102 INFO L225 Difference]: With dead ends: 108 [2025-04-29 10:50:37,102 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 10:50:37,102 INFO L436 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-04-29 10:50:37,103 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 10:50:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-29 10:50:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 74 states have internal predecessors, (97), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-04-29 10:50:37,112 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 27 [2025-04-29 10:50:37,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,112 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-04-29 10:50:37,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-04-29 10:50:37,113 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-04-29 10:50:37,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:50:37,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,113 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, 1, 1, 1] [2025-04-29 10:50:37,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:50:37,114 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1746965790, now seen corresponding path program 1 times [2025-04-29 10:50:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264798057] [2025-04-29 10:50:37,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:50:37,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:50:37,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264798057] [2025-04-29 10:50:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264798057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:37,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319311418] [2025-04-29 10:50:37,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:37,263 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-04-29 10:50:37,265 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-04-29 10:50:37,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:50:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:50:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 10:50:37,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:37,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319311418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:37,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2025-04-29 10:50:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455756842] [2025-04-29 10:50:37,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:50:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:50:37,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:50:37,520 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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-04-29 10:50:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,842 INFO L93 Difference]: Finished difference Result 225 states and 326 transitions. [2025-04-29 10:50:37,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 10:50:37,842 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 28 [2025-04-29 10:50:37,843 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,843 INFO L225 Difference]: With dead ends: 225 [2025-04-29 10:50:37,844 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 10:50:37,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-04-29 10:50:37,848 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 244 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 593 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 10:50:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 85. [2025-04-29 10:50:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 77 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-04-29 10:50:37,861 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 28 [2025-04-29 10:50:37,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,861 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-04-29 10:50:37,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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-04-29 10:50:37,862 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-04-29 10:50:37,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:50:37,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,863 INFO L218 NwaCegarLoop]: trace histogram [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-04-29 10:50:37,868 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-04-29 10:50:38,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,067 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:38,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -721353991, now seen corresponding path program 1 times [2025-04-29 10:50:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:38,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557403854] [2025-04-29 10:50:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:38,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:50:38,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:50:38,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:38,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557403854] [2025-04-29 10:50:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557403854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209480254] [2025-04-29 10:50:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:38,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:38,099 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-29 10:50:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:38,141 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2025-04-29 10:50:38,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:38,142 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 28 [2025-04-29 10:50:38,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:38,143 INFO L225 Difference]: With dead ends: 117 [2025-04-29 10:50:38,143 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 10:50:38,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:38,145 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:38,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 10:50:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 10:50:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 87 states have internal predecessors, (116), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2025-04-29 10:50:38,157 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 28 [2025-04-29 10:50:38,157 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:38,157 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2025-04-29 10:50:38,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-29 10:50:38,157 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2025-04-29 10:50:38,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:50:38,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:38,158 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, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:38,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 10:50:38,158 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:38,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1744977629, now seen corresponding path program 1 times [2025-04-29 10:50:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:38,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194525637] [2025-04-29 10:50:38,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:38,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:50:38,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:50:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:38,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:38,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194525637] [2025-04-29 10:50:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194525637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:38,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587605891] [2025-04-29 10:50:38,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:38,416 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-04-29 10:50:38,417 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-04-29 10:50:38,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:50:38,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:50:38,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 10:50:38,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:50:38,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587605891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:38,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:38,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2025-04-29 10:50:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558328598] [2025-04-29 10:50:38,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:50:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:50:38,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:50:38,831 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:39,294 INFO L93 Difference]: Finished difference Result 168 states and 231 transitions. [2025-04-29 10:50:39,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:50:39,294 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-04-29 10:50:39,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:39,295 INFO L225 Difference]: With dead ends: 168 [2025-04-29 10:50:39,295 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 10:50:39,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:50:39,296 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 126 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:39,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 974 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:50:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 10:50:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2025-04-29 10:50:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.38) internal successors, (138), 104 states have internal predecessors, (138), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:50:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2025-04-29 10:50:39,316 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 31 [2025-04-29 10:50:39,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:39,317 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2025-04-29 10:50:39,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:39,317 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2025-04-29 10:50:39,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:50:39,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:39,318 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:39,324 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-04-29 10:50:39,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 10:50:39,518 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:39,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash -934167742, now seen corresponding path program 1 times [2025-04-29 10:50:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:39,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214619527] [2025-04-29 10:50:39,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:50:39,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:50:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:50:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:39,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214619527] [2025-04-29 10:50:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214619527] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:39,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920159709] [2025-04-29 10:50:39,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:39,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:39,687 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-04-29 10:50:39,689 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-04-29 10:50:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:50:39,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:50:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:39,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 10:50:39,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:39,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:40,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920159709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:40,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:40,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 24 [2025-04-29 10:50:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101702463] [2025-04-29 10:50:40,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:40,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 10:50:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:40,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 10:50:40,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-04-29 10:50:40,254 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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-04-29 10:50:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:41,001 INFO L93 Difference]: Finished difference Result 254 states and 349 transitions. [2025-04-29 10:50:41,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 10:50:41,001 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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 33 [2025-04-29 10:50:41,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:41,003 INFO L225 Difference]: With dead ends: 254 [2025-04-29 10:50:41,003 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 10:50:41,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 10:50:41,004 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:41,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1010 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:50:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 10:50:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2025-04-29 10:50:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 111 states have internal predecessors, (148), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:50:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2025-04-29 10:50:41,014 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 33 [2025-04-29 10:50:41,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:41,014 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2025-04-29 10:50:41,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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-04-29 10:50:41,014 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2025-04-29 10:50:41,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:50:41,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:41,015 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-04-29 10:50:41,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:41,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,219 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:41,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1978533696, now seen corresponding path program 1 times [2025-04-29 10:50:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:41,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304637669] [2025-04-29 10:50:41,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:41,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:50:41,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:50:41,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:41,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304637669] [2025-04-29 10:50:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304637669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:41,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983509401] [2025-04-29 10:50:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:41,295 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-04-29 10:50:41,297 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-04-29 10:50:41,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:50:41,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:50:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 10:50:41,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:41,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983509401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:41,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 15 [2025-04-29 10:50:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235928652] [2025-04-29 10:50:41,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:41,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 10:50:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 10:50:41,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-29 10:50:41,534 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:41,648 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2025-04-29 10:50:41,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:50:41,648 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-04-29 10:50:41,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:41,650 INFO L225 Difference]: With dead ends: 200 [2025-04-29 10:50:41,650 INFO L226 Difference]: Without dead ends: 179 [2025-04-29 10:50:41,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-29 10:50:41,650 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:41,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 577 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-29 10:50:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2025-04-29 10:50:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 125 states have internal predecessors, (167), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 186 transitions. [2025-04-29 10:50:41,666 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 186 transitions. Word has length 33 [2025-04-29 10:50:41,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:41,666 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 186 transitions. [2025-04-29 10:50:41,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:41,666 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 186 transitions. [2025-04-29 10:50:41,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:50:41,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:41,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:41,673 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-04-29 10:50:41,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,867 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:41,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1381294323, now seen corresponding path program 2 times [2025-04-29 10:50:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:41,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976466618] [2025-04-29 10:50:41,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:41,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:50:41,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:50:41,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:41,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976466618] [2025-04-29 10:50:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976466618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:41,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:41,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740079188] [2025-04-29 10:50:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:41,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:41,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:41,973 INFO L87 Difference]: Start difference. First operand 135 states and 186 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-04-29 10:50:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:42,045 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2025-04-29 10:50:42,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:42,045 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 34 [2025-04-29 10:50:42,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:42,047 INFO L225 Difference]: With dead ends: 167 [2025-04-29 10:50:42,048 INFO L226 Difference]: Without dead ends: 159 [2025-04-29 10:50:42,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:42,049 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:42,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 229 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-29 10:50:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2025-04-29 10:50:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 126 states have internal predecessors, (167), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2025-04-29 10:50:42,060 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 34 [2025-04-29 10:50:42,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:42,060 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2025-04-29 10:50:42,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-04-29 10:50:42,060 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2025-04-29 10:50:42,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:50:42,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:42,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:42,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 10:50:42,061 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:42,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1842413855, now seen corresponding path program 1 times [2025-04-29 10:50:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:42,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78135763] [2025-04-29 10:50:42,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:42,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:42,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:42,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:42,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:42,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78135763] [2025-04-29 10:50:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78135763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812040827] [2025-04-29 10:50:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:42,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:42,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:42,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:42,107 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-04-29 10:50:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:42,135 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2025-04-29 10:50:42,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:42,136 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 37 [2025-04-29 10:50:42,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:42,137 INFO L225 Difference]: With dead ends: 162 [2025-04-29 10:50:42,137 INFO L226 Difference]: Without dead ends: 129 [2025-04-29 10:50:42,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-04-29 10:50:42,137 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:42,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 173 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-29 10:50:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-04-29 10:50:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 117 states have internal predecessors, (153), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 172 transitions. [2025-04-29 10:50:42,149 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 172 transitions. Word has length 37 [2025-04-29 10:50:42,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:42,150 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 172 transitions. [2025-04-29 10:50:42,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-04-29 10:50:42,150 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2025-04-29 10:50:42,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:50:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:42,150 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-04-29 10:50:42,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 10:50:42,150 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:42,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1998170625, now seen corresponding path program 1 times [2025-04-29 10:50:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:42,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767318247] [2025-04-29 10:50:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:42,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:50:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:50:42,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:50:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:42,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767318247] [2025-04-29 10:50:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767318247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:42,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030945425] [2025-04-29 10:50:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:42,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:42,343 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-04-29 10:50:42,344 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-04-29 10:50:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:50:42,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:50:42,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:42,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 10:50:42,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:50:42,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030945425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:42,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:42,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 12] total 21 [2025-04-29 10:50:42,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784763561] [2025-04-29 10:50:42,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:42,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:50:42,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:42,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:50:42,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:50:42,721 INFO L87 Difference]: Start difference. First operand 127 states and 172 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:42,989 INFO L93 Difference]: Finished difference Result 185 states and 246 transitions. [2025-04-29 10:50:42,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 10:50:42,990 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-04-29 10:50:42,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:42,990 INFO L225 Difference]: With dead ends: 185 [2025-04-29 10:50:42,990 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 10:50:42,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:50:42,991 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:42,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1032 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 10:50:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 127. [2025-04-29 10:50:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 117 states have internal predecessors, (152), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2025-04-29 10:50:43,001 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 36 [2025-04-29 10:50:43,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:43,002 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2025-04-29 10:50:43,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:43,002 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2025-04-29 10:50:43,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:50:43,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:43,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:43,008 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-04-29 10:50:43,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 10:50:43,206 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:43,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash -722324462, now seen corresponding path program 1 times [2025-04-29 10:50:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:43,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21397559] [2025-04-29 10:50:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:43,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:43,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:43,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:50:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:43,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21397559] [2025-04-29 10:50:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21397559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:43,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130977881] [2025-04-29 10:50:43,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:43,302 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-04-29 10:50:43,305 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-04-29 10:50:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 10:50:43,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:43,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:50:43,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130977881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:43,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 20 [2025-04-29 10:50:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925176939] [2025-04-29 10:50:43,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:43,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 10:50:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:43,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 10:50:43,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:50:43,663 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:44,051 INFO L93 Difference]: Finished difference Result 319 states and 463 transitions. [2025-04-29 10:50:44,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:50:44,051 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 10:50:44,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:44,052 INFO L225 Difference]: With dead ends: 319 [2025-04-29 10:50:44,052 INFO L226 Difference]: Without dead ends: 294 [2025-04-29 10:50:44,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-04-29 10:50:44,053 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 193 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:44,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 784 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-29 10:50:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 169. [2025-04-29 10:50:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 159 states have internal predecessors, (214), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2025-04-29 10:50:44,067 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 37 [2025-04-29 10:50:44,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:44,068 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2025-04-29 10:50:44,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:44,068 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2025-04-29 10:50:44,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:50:44,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:44,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:44,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 10:50:44,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 10:50:44,269 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:44,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1531671088, now seen corresponding path program 1 times [2025-04-29 10:50:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:44,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447107330] [2025-04-29 10:50:44,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:44,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:44,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:44,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:44,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447107330] [2025-04-29 10:50:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447107330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:44,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779191037] [2025-04-29 10:50:44,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:44,677 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-04-29 10:50:44,679 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-04-29 10:50:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:44,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:44,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 10:50:44,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:44,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:50:44,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 10:50:44,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:50:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:44,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:45,098 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:50:45,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2025-04-29 10:50:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779191037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:45,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-04-29 10:50:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101207139] [2025-04-29 10:50:45,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:45,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 10:50:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:45,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 10:50:45,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-04-29 10:50:45,155 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:45,681 INFO L93 Difference]: Finished difference Result 359 states and 505 transitions. [2025-04-29 10:50:45,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:50:45,682 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 10:50:45,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:45,683 INFO L225 Difference]: With dead ends: 359 [2025-04-29 10:50:45,683 INFO L226 Difference]: Without dead ends: 298 [2025-04-29 10:50:45,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 10:50:45,684 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 120 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:45,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1037 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-29 10:50:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 213. [2025-04-29 10:50:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 203 states have internal predecessors, (279), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2025-04-29 10:50:45,702 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 37 [2025-04-29 10:50:45,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:45,702 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2025-04-29 10:50:45,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:45,703 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2025-04-29 10:50:45,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:50:45,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:45,703 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, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:45,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:45,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:45,906 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:45,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1284856225, now seen corresponding path program 1 times [2025-04-29 10:50:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:45,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441888231] [2025-04-29 10:50:45,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:45,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:45,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:45,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:50:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:46,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441888231] [2025-04-29 10:50:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441888231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:46,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216188009] [2025-04-29 10:50:46,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:46,023 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-04-29 10:50:46,024 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-04-29 10:50:46,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:50:46,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:50:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 10:50:46,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:46,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216188009] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:46,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:46,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 20 [2025-04-29 10:50:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555625584] [2025-04-29 10:50:46,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:46,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 10:50:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:46,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 10:50:46,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:50:46,289 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:46,524 INFO L93 Difference]: Finished difference Result 315 states and 430 transitions. [2025-04-29 10:50:46,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:50:46,524 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 10:50:46,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:46,525 INFO L225 Difference]: With dead ends: 315 [2025-04-29 10:50:46,525 INFO L226 Difference]: Without dead ends: 200 [2025-04-29 10:50:46,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:50:46,526 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:46,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 655 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-29 10:50:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2025-04-29 10:50:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 177 states have internal predecessors, (234), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2025-04-29 10:50:46,551 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 37 [2025-04-29 10:50:46,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:46,551 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2025-04-29 10:50:46,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:46,551 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2025-04-29 10:50:46,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:50:46,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:46,551 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:46,559 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-04-29 10:50:46,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,752 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:46,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1561875071, now seen corresponding path program 1 times [2025-04-29 10:50:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:46,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017707107] [2025-04-29 10:50:46,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:46,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:50:46,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:50:46,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:50:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:46,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017707107] [2025-04-29 10:50:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017707107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:46,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450870161] [2025-04-29 10:50:46,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:46,836 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-04-29 10:50:46,837 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-04-29 10:50:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:50:46,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:50:46,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:46,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:50:46,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:46,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:46,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450870161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:46,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:46,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-04-29 10:50:46,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89577197] [2025-04-29 10:50:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:46,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:46,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:46,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:46,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:50:46,906 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:46,935 INFO L93 Difference]: Finished difference Result 212 states and 287 transitions. [2025-04-29 10:50:46,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:46,935 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-04-29 10:50:46,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:46,936 INFO L225 Difference]: With dead ends: 212 [2025-04-29 10:50:46,936 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 10:50:46,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:50:46,937 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:46,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 10:50:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-04-29 10:50:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 176 states have (on average 1.3636363636363635) internal successors, (240), 181 states have internal predecessors, (240), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2025-04-29 10:50:46,955 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 39 [2025-04-29 10:50:46,955 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:46,955 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2025-04-29 10:50:46,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:46,955 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2025-04-29 10:50:46,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:50:46,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:46,956 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:46,961 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-04-29 10:50:47,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 10:50:47,158 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:47,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -466949793, now seen corresponding path program 2 times [2025-04-29 10:50:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:47,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979301720] [2025-04-29 10:50:47,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:47,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:47,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 10:50:47,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 38 statements. [2025-04-29 10:50:47,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:50:47,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:50:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:47,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979301720] [2025-04-29 10:50:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979301720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:50:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916402066] [2025-04-29 10:50:47,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:47,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:47,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:47,300 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-04-29 10:50:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:47,391 INFO L93 Difference]: Finished difference Result 240 states and 326 transitions. [2025-04-29 10:50:47,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:47,391 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 38 [2025-04-29 10:50:47,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:47,392 INFO L225 Difference]: With dead ends: 240 [2025-04-29 10:50:47,392 INFO L226 Difference]: Without dead ends: 232 [2025-04-29 10:50:47,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:47,394 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:47,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 168 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-29 10:50:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2025-04-29 10:50:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 183 states have (on average 1.360655737704918) internal successors, (249), 188 states have internal predecessors, (249), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2025-04-29 10:50:47,414 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 38 [2025-04-29 10:50:47,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:47,414 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2025-04-29 10:50:47,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-04-29 10:50:47,414 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2025-04-29 10:50:47,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:50:47,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:47,415 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-04-29 10:50:47,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 10:50:47,415 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:47,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -838777424, now seen corresponding path program 2 times [2025-04-29 10:50:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:47,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634313102] [2025-04-29 10:50:47,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:47,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 10:50:47,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:50:47,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:50:47,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:47,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634313102] [2025-04-29 10:50:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634313102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:47,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569160385] [2025-04-29 10:50:47,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:47,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:47,654 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:47,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 10:50:47,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 10:50:47,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:50:47,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:47,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 10:50:47,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:47,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569160385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:47,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2025-04-29 10:50:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760334487] [2025-04-29 10:50:47,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:47,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 10:50:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:47,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 10:50:47,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:50:47,887 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:48,054 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2025-04-29 10:50:48,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:50:48,055 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-04-29 10:50:48,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:48,055 INFO L225 Difference]: With dead ends: 250 [2025-04-29 10:50:48,056 INFO L226 Difference]: Without dead ends: 179 [2025-04-29 10:50:48,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:50:48,056 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 33 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:48,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 928 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-29 10:50:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2025-04-29 10:50:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 154 states have internal predecessors, (199), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2025-04-29 10:50:48,081 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 38 [2025-04-29 10:50:48,081 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:48,081 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2025-04-29 10:50:48,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:48,081 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2025-04-29 10:50:48,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:50:48,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:48,082 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-29 10:50:48,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:48,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 10:50:48,286 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:48,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2119432701, now seen corresponding path program 3 times [2025-04-29 10:50:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:48,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174139206] [2025-04-29 10:50:48,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:50:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:48,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:50:48,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:50:48,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:50:48,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:50:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:48,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174139206] [2025-04-29 10:50:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174139206] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:48,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728604686] [2025-04-29 10:50:48,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:50:48,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:48,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:48,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:48,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 10:50:48,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:50:48,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:50:48,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:50:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:48,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:50:48,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:48,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:50:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728604686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:48,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2025-04-29 10:50:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782059698] [2025-04-29 10:50:48,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:48,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 10:50:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:48,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 10:50:48,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:50:48,929 INFO L87 Difference]: Start difference. First operand 164 states and 218 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:49,368 INFO L93 Difference]: Finished difference Result 287 states and 396 transitions. [2025-04-29 10:50:49,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:50:49,369 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-04-29 10:50:49,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:49,370 INFO L225 Difference]: With dead ends: 287 [2025-04-29 10:50:49,370 INFO L226 Difference]: Without dead ends: 277 [2025-04-29 10:50:49,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 10:50:49,371 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 223 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:49,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 967 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-29 10:50:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 172. [2025-04-29 10:50:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 157 states have (on average 1.3312101910828025) internal successors, (209), 162 states have internal predecessors, (209), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 228 transitions. [2025-04-29 10:50:49,390 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 228 transitions. Word has length 39 [2025-04-29 10:50:49,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:49,390 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 228 transitions. [2025-04-29 10:50:49,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:50:49,391 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2025-04-29 10:50:49,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:50:49,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:49,391 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2025-04-29 10:50:49,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:49,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:49,592 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:49,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -368340898, now seen corresponding path program 1 times [2025-04-29 10:50:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:49,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352755174] [2025-04-29 10:50:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:49,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:50:49,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:50:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:49,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:50:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:50,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352755174] [2025-04-29 10:50:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352755174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:50,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701590253] [2025-04-29 10:50:50,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:50,108 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:50,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 10:50:50,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:50:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:50:50,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-29 10:50:50,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:50,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:50:50,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 10:50:50,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:50:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:50:50,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:51,107 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:50:51,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-04-29 10:50:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:50:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701590253] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:51,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 13] total 44 [2025-04-29 10:50:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918388306] [2025-04-29 10:50:51,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:51,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 10:50:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:51,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 10:50:51,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 10:50:51,272 INFO L87 Difference]: Start difference. First operand 172 states and 228 transitions. Second operand has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:51,932 INFO L93 Difference]: Finished difference Result 301 states and 402 transitions. [2025-04-29 10:50:51,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:50:51,933 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-04-29 10:50:51,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:51,934 INFO L225 Difference]: With dead ends: 301 [2025-04-29 10:50:51,934 INFO L226 Difference]: Without dead ends: 218 [2025-04-29 10:50:51,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 10:50:51,935 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 115 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:51,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 807 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 10:50:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-29 10:50:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2025-04-29 10:50:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 169 states have (on average 1.319526627218935) internal successors, (223), 174 states have internal predecessors, (223), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2025-04-29 10:50:51,958 INFO L79 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 42 [2025-04-29 10:50:51,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:51,958 INFO L485 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2025-04-29 10:50:51,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 43 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:51,959 INFO L278 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2025-04-29 10:50:51,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 10:50:51,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:51,960 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:51,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:52,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:52,160 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:52,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1873615507, now seen corresponding path program 1 times [2025-04-29 10:50:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:52,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4917297] [2025-04-29 10:50:52,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:52,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 10:50:52,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 10:50:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:52,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:52,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4917297] [2025-04-29 10:50:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4917297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:52,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877644350] [2025-04-29 10:50:52,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:52,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:52,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:52,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:52,193 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:52,228 INFO L93 Difference]: Finished difference Result 204 states and 266 transitions. [2025-04-29 10:50:52,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:52,229 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-04-29 10:50:52,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:52,230 INFO L225 Difference]: With dead ends: 204 [2025-04-29 10:50:52,230 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 10:50:52,230 INFO L436 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-04-29 10:50:52,230 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:52,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 10:50:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2025-04-29 10:50:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 172 states have internal predecessors, (220), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2025-04-29 10:50:52,253 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 44 [2025-04-29 10:50:52,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:52,253 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2025-04-29 10:50:52,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:52,253 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2025-04-29 10:50:52,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 10:50:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:52,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2025-04-29 10:50:52,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 10:50:52,255 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:52,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1301058538, now seen corresponding path program 1 times [2025-04-29 10:50:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:52,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259658987] [2025-04-29 10:50:52,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:52,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 10:50:52,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 10:50:52,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:52,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:52,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259658987] [2025-04-29 10:50:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259658987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:52,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443835913] [2025-04-29 10:50:52,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:52,384 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:52,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 10:50:52,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 10:50:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 10:50:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:52,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 10:50:52,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:52,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:50:52,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 10:50:52,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 10:50:52,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:50:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:50:52,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:50:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443835913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:53,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 14] total 35 [2025-04-29 10:50:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419846979] [2025-04-29 10:50:53,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:53,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 10:50:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:53,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 10:50:53,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 10:50:53,089 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:54,230 INFO L93 Difference]: Finished difference Result 526 states and 717 transitions. [2025-04-29 10:50:54,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-29 10:50:54,230 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-04-29 10:50:54,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:54,231 INFO L225 Difference]: With dead ends: 526 [2025-04-29 10:50:54,231 INFO L226 Difference]: Without dead ends: 409 [2025-04-29 10:50:54,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=3149, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 10:50:54,232 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 237 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:54,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1779 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:50:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-04-29 10:50:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 283. [2025-04-29 10:50:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 268 states have (on average 1.335820895522388) internal successors, (358), 272 states have internal predecessors, (358), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 10:50:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 377 transitions. [2025-04-29 10:50:54,267 INFO L79 Accepts]: Start accepts. Automaton has 283 states and 377 transitions. Word has length 44 [2025-04-29 10:50:54,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:54,267 INFO L485 AbstractCegarLoop]: Abstraction has 283 states and 377 transitions. [2025-04-29 10:50:54,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:54,267 INFO L278 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2025-04-29 10:50:54,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 10:50:54,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:54,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:54,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 10:50:54,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 10:50:54,472 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:54,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1590597103, now seen corresponding path program 1 times [2025-04-29 10:50:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:54,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70298459] [2025-04-29 10:50:54,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:54,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 10:50:54,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:50:54,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:54,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:54,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70298459] [2025-04-29 10:50:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70298459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:54,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57299599] [2025-04-29 10:50:54,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:54,556 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:54,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 10:50:54,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 10:50:54,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:50:54,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:54,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:54,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 10:50:54,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:50:54,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57299599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:54,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-04-29 10:50:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964555767] [2025-04-29 10:50:54,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:54,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:50:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:54,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:50:54,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:54,752 INFO L87 Difference]: Start difference. First operand 283 states and 377 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:50:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:54,942 INFO L93 Difference]: Finished difference Result 350 states and 461 transitions. [2025-04-29 10:50:54,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:50:54,942 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2025-04-29 10:50:54,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:54,943 INFO L225 Difference]: With dead ends: 350 [2025-04-29 10:50:54,943 INFO L226 Difference]: Without dead ends: 291 [2025-04-29 10:50:54,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:50:54,944 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:54,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 428 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-29 10:50:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 255. [2025-04-29 10:50:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 247 states have internal predecessors, (328), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 341 transitions. [2025-04-29 10:50:54,972 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 341 transitions. Word has length 47 [2025-04-29 10:50:54,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:54,973 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 341 transitions. [2025-04-29 10:50:54,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:50:54,973 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 341 transitions. [2025-04-29 10:50:54,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 10:50:54,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:54,974 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1] [2025-04-29 10:50:54,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:55,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 10:50:55,174 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:55,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1934331766, now seen corresponding path program 1 times [2025-04-29 10:50:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:55,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691826348] [2025-04-29 10:50:55,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:55,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 10:50:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:50:55,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:55,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:50:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:55,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691826348] [2025-04-29 10:50:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691826348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:55,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430006618] [2025-04-29 10:50:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:55,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:55,323 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:55,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 10:50:55,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 10:50:55,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:50:55,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:55,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:55,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-29 10:50:55,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:55,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:50:55,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:50:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:55,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 10:50:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430006618] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:56,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 15] total 40 [2025-04-29 10:50:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484556925] [2025-04-29 10:50:56,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:56,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 10:50:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:56,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 10:50:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 10:50:56,609 INFO L87 Difference]: Start difference. First operand 255 states and 341 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:58,982 INFO L93 Difference]: Finished difference Result 682 states and 935 transitions. [2025-04-29 10:50:58,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-29 10:50:58,983 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-04-29 10:50:58,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:58,985 INFO L225 Difference]: With dead ends: 682 [2025-04-29 10:50:58,985 INFO L226 Difference]: Without dead ends: 485 [2025-04-29 10:50:58,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=781, Invalid=4621, Unknown=0, NotChecked=0, Total=5402 [2025-04-29 10:50:58,986 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 204 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:58,986 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1305 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 10:50:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-29 10:50:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 283. [2025-04-29 10:50:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 272 states have (on average 1.3455882352941178) internal successors, (366), 275 states have internal predecessors, (366), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:50:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 379 transitions. [2025-04-29 10:50:59,030 INFO L79 Accepts]: Start accepts. Automaton has 283 states and 379 transitions. Word has length 45 [2025-04-29 10:50:59,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:59,030 INFO L485 AbstractCegarLoop]: Abstraction has 283 states and 379 transitions. [2025-04-29 10:50:59,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:50:59,030 INFO L278 IsEmpty]: Start isEmpty. Operand 283 states and 379 transitions. [2025-04-29 10:50:59,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 10:50:59,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:59,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:59,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:59,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 10:50:59,231 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:59,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash 73585067, now seen corresponding path program 1 times [2025-04-29 10:50:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:59,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982057534] [2025-04-29 10:50:59,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:59,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 10:50:59,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:50:59,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:59,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:50:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:59,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982057534] [2025-04-29 10:50:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982057534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:59,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158275705] [2025-04-29 10:50:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:59,324 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:59,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 10:50:59,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 10:50:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:50:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:59,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:50:59,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:59,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158275705] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:59,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-29 10:50:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055063371] [2025-04-29 10:50:59,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:59,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:50:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:59,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:50:59,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:59,547 INFO L87 Difference]: Start difference. First operand 283 states and 379 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-29 10:50:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:59,714 INFO L93 Difference]: Finished difference Result 333 states and 444 transitions. [2025-04-29 10:50:59,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:50:59,715 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2025-04-29 10:50:59,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:59,716 INFO L225 Difference]: With dead ends: 333 [2025-04-29 10:50:59,716 INFO L226 Difference]: Without dead ends: 290 [2025-04-29 10:50:59,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:50:59,717 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:59,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 419 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-04-29 10:50:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2025-04-29 10:50:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 271 states have (on average 1.3431734317343174) internal successors, (364), 274 states have internal predecessors, (364), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:50:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 379 transitions. [2025-04-29 10:50:59,753 INFO L79 Accepts]: Start accepts. Automaton has 283 states and 379 transitions. Word has length 47 [2025-04-29 10:50:59,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:59,753 INFO L485 AbstractCegarLoop]: Abstraction has 283 states and 379 transitions. [2025-04-29 10:50:59,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-29 10:50:59,753 INFO L278 IsEmpty]: Start isEmpty. Operand 283 states and 379 transitions. [2025-04-29 10:50:59,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 10:50:59,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:59,754 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-04-29 10:50:59,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:59,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:59,955 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:59,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1117103749, now seen corresponding path program 2 times [2025-04-29 10:50:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:59,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316453465] [2025-04-29 10:50:59,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:59,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 10:50:59,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 10:50:59,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:59,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:51:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:00,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316453465] [2025-04-29 10:51:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316453465] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:00,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822968214] [2025-04-29 10:51:00,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:00,384 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:00,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 10:51:00,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 10:51:00,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 10:51:00,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:00,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 10:51:00,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:00,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822968214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:00,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-04-29 10:51:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849920895] [2025-04-29 10:51:00,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:00,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 10:51:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:00,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 10:51:00,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-04-29 10:51:00,726 INFO L87 Difference]: Start difference. First operand 283 states and 379 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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-04-29 10:51:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:01,400 INFO L93 Difference]: Finished difference Result 512 states and 682 transitions. [2025-04-29 10:51:01,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 10:51:01,401 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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 46 [2025-04-29 10:51:01,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:01,402 INFO L225 Difference]: With dead ends: 512 [2025-04-29 10:51:01,402 INFO L226 Difference]: Without dead ends: 417 [2025-04-29 10:51:01,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 10:51:01,403 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 148 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:01,403 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1414 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:51:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-04-29 10:51:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 233. [2025-04-29 10:51:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 221 states have (on average 1.330316742081448) internal successors, (294), 224 states have internal predecessors, (294), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:51:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 309 transitions. [2025-04-29 10:51:01,445 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 309 transitions. Word has length 46 [2025-04-29 10:51:01,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:01,445 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 309 transitions. [2025-04-29 10:51:01,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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-04-29 10:51:01,445 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 309 transitions. [2025-04-29 10:51:01,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 10:51:01,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:01,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:01,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 10:51:01,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-29 10:51:01,646 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:01,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1508470924, now seen corresponding path program 1 times [2025-04-29 10:51:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:01,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362498547] [2025-04-29 10:51:01,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:01,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:01,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 10:51:01,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:51:01,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:01,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:01,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:01,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362498547] [2025-04-29 10:51:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362498547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:01,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617998062] [2025-04-29 10:51:01,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:01,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:01,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:01,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 10:51:01,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 10:51:01,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:51:01,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:01,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:01,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 10:51:01,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:51:02,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617998062] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:02,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 28 [2025-04-29 10:51:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833940931] [2025-04-29 10:51:02,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:02,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 10:51:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:02,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 10:51:02,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-04-29 10:51:02,355 INFO L87 Difference]: Start difference. First operand 233 states and 309 transitions. Second operand has 28 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 10:51:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:03,117 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2025-04-29 10:51:03,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 10:51:03,117 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2025-04-29 10:51:03,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:03,119 INFO L225 Difference]: With dead ends: 388 [2025-04-29 10:51:03,119 INFO L226 Difference]: Without dead ends: 318 [2025-04-29 10:51:03,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=2116, Unknown=0, NotChecked=0, Total=2450 [2025-04-29 10:51:03,120 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 245 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:03,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 611 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:51:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-29 10:51:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 239. [2025-04-29 10:51:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 228 states have (on average 1.3026315789473684) internal successors, (297), 230 states have internal predecessors, (297), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2025-04-29 10:51:03,162 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 49 [2025-04-29 10:51:03,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:03,162 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2025-04-29 10:51:03,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 10:51:03,162 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2025-04-29 10:51:03,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 10:51:03,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:03,163 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04-29 10:51:03,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-29 10:51:03,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,363 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:03,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2117014592, now seen corresponding path program 4 times [2025-04-29 10:51:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:03,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656160644] [2025-04-29 10:51:03,364 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:51:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:03,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-29 10:51:03,375 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:51:03,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:51:03,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:51:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:03,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656160644] [2025-04-29 10:51:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656160644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:03,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729389630] [2025-04-29 10:51:03,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:51:03,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:03,456 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:03,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-29 10:51:03,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-29 10:51:03,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:51:03,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:51:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:03,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 10:51:03,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:51:03,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:51:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729389630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:03,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2025-04-29 10:51:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588920477] [2025-04-29 10:51:03,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:03,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 10:51:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:03,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 10:51:03,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-04-29 10:51:03,796 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:04,034 INFO L93 Difference]: Finished difference Result 315 states and 400 transitions. [2025-04-29 10:51:04,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 10:51:04,034 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-04-29 10:51:04,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:04,035 INFO L225 Difference]: With dead ends: 315 [2025-04-29 10:51:04,035 INFO L226 Difference]: Without dead ends: 246 [2025-04-29 10:51:04,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2025-04-29 10:51:04,036 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 33 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:04,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1313 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:51:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-29 10:51:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 221. [2025-04-29 10:51:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 212 states have internal predecessors, (272), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2025-04-29 10:51:04,077 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 48 [2025-04-29 10:51:04,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:04,077 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2025-04-29 10:51:04,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:04,077 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2025-04-29 10:51:04,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 10:51:04,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:04,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2025-04-29 10:51:04,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-29 10:51:04,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:04,282 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:04,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 718751264, now seen corresponding path program 2 times [2025-04-29 10:51:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:04,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626986735] [2025-04-29 10:51:04,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:04,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 10:51:04,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:51:04,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:04,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626986735] [2025-04-29 10:51:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626986735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:04,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170061532] [2025-04-29 10:51:04,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:04,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:04,686 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-29 10:51:04,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 10:51:04,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:51:04,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:04,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:04,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 10:51:04,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:04,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170061532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:05,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-04-29 10:51:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695323417] [2025-04-29 10:51:05,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:05,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 10:51:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:05,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 10:51:05,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2025-04-29 10:51:05,416 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 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-04-29 10:51:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:14,535 INFO L93 Difference]: Finished difference Result 418 states and 543 transitions. [2025-04-29 10:51:14,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:51:14,536 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 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 49 [2025-04-29 10:51:14,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:14,537 INFO L225 Difference]: With dead ends: 418 [2025-04-29 10:51:14,537 INFO L226 Difference]: Without dead ends: 410 [2025-04-29 10:51:14,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 10:51:14,538 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 147 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:14,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1338 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:51:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-29 10:51:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 224. [2025-04-29 10:51:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 213 states have (on average 1.2910798122065728) internal successors, (275), 215 states have internal predecessors, (275), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2025-04-29 10:51:14,591 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 49 [2025-04-29 10:51:14,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:14,592 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2025-04-29 10:51:14,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 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-04-29 10:51:14,592 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2025-04-29 10:51:14,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 10:51:14,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:14,593 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1] [2025-04-29 10:51:14,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-29 10:51:14,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:14,793 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:14,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1725950433, now seen corresponding path program 2 times [2025-04-29 10:51:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:14,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951574314] [2025-04-29 10:51:14,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:14,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-29 10:51:14,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:14,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:14,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:51:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:14,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951574314] [2025-04-29 10:51:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951574314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:14,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761825768] [2025-04-29 10:51:14,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:14,925 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:14,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-29 10:51:14,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-29 10:51:15,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:15,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:15,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:51:15,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:51:15,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:51:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761825768] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:15,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:15,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2025-04-29 10:51:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396445419] [2025-04-29 10:51:15,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:15,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 10:51:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:15,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 10:51:15,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-04-29 10:51:15,477 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:17,761 INFO L93 Difference]: Finished difference Result 703 states and 924 transitions. [2025-04-29 10:51:17,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-29 10:51:17,761 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-04-29 10:51:17,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:17,762 INFO L225 Difference]: With dead ends: 703 [2025-04-29 10:51:17,762 INFO L226 Difference]: Without dead ends: 516 [2025-04-29 10:51:17,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=831, Invalid=7541, Unknown=0, NotChecked=0, Total=8372 [2025-04-29 10:51:17,765 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 215 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:17,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1201 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:51:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-29 10:51:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 414. [2025-04-29 10:51:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 403 states have (on average 1.3076923076923077) internal successors, (527), 405 states have internal predecessors, (527), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 540 transitions. [2025-04-29 10:51:17,848 INFO L79 Accepts]: Start accepts. Automaton has 414 states and 540 transitions. Word has length 50 [2025-04-29 10:51:17,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:17,848 INFO L485 AbstractCegarLoop]: Abstraction has 414 states and 540 transitions. [2025-04-29 10:51:17,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:17,848 INFO L278 IsEmpty]: Start isEmpty. Operand 414 states and 540 transitions. [2025-04-29 10:51:17,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 10:51:17,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:17,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2025-04-29 10:51:17,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-29 10:51:18,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:18,049 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:18,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1445914217, now seen corresponding path program 3 times [2025-04-29 10:51:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:18,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814779428] [2025-04-29 10:51:18,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:51:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:18,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-04-29 10:51:18,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:18,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:51:18,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:51:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:19,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814779428] [2025-04-29 10:51:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814779428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:19,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505943550] [2025-04-29 10:51:19,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:51:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:19,426 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:19,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-29 10:51:19,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-04-29 10:51:19,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:19,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:51:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:19,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-29 10:51:19,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:19,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:51:19,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 10:51:20,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 10:51:20,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:51:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:51:20,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:20,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:51:20,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2025-04-29 10:51:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505943550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:21,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 18] total 60 [2025-04-29 10:51:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890192837] [2025-04-29 10:51:21,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:21,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-29 10:51:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:21,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-29 10:51:21,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3273, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 10:51:21,061 INFO L87 Difference]: Start difference. First operand 414 states and 540 transitions. Second operand has 60 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 58 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:51:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:24,662 INFO L93 Difference]: Finished difference Result 920 states and 1212 transitions. [2025-04-29 10:51:24,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-29 10:51:24,663 INFO L79 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 58 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-04-29 10:51:24,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:24,664 INFO L225 Difference]: With dead ends: 920 [2025-04-29 10:51:24,664 INFO L226 Difference]: Without dead ends: 745 [2025-04-29 10:51:24,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2855 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1008, Invalid=10122, Unknown=0, NotChecked=0, Total=11130 [2025-04-29 10:51:24,667 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 352 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:24,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1192 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-29 10:51:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-04-29 10:51:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 437. [2025-04-29 10:51:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 426 states have (on average 1.3028169014084507) internal successors, (555), 428 states have internal predecessors, (555), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 568 transitions. [2025-04-29 10:51:24,794 INFO L79 Accepts]: Start accepts. Automaton has 437 states and 568 transitions. Word has length 50 [2025-04-29 10:51:24,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:24,794 INFO L485 AbstractCegarLoop]: Abstraction has 437 states and 568 transitions. [2025-04-29 10:51:24,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 58 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:51:24,794 INFO L278 IsEmpty]: Start isEmpty. Operand 437 states and 568 transitions. [2025-04-29 10:51:24,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 10:51:24,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:24,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2025-04-29 10:51:24,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-29 10:51:24,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-29 10:51:24,995 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:24,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 438970241, now seen corresponding path program 4 times [2025-04-29 10:51:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:24,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864650242] [2025-04-29 10:51:24,996 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:51:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:25,002 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-29 10:51:25,014 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:25,015 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:51:25,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:25,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864650242] [2025-04-29 10:51:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864650242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:25,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554186867] [2025-04-29 10:51:25,567 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:51:25,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:25,573 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:25,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-29 10:51:25,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-29 10:51:25,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:51:25,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:51:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:25,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 10:51:25,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:25,924 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 10:51:25,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:51:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:51:25,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:26,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:51:26,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2025-04-29 10:51:26,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:51:26,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2025-04-29 10:51:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:51:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554186867] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:26,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 17] total 35 [2025-04-29 10:51:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372001016] [2025-04-29 10:51:26,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:26,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 10:51:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:26,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 10:51:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 10:51:26,464 INFO L87 Difference]: Start difference. First operand 437 states and 568 transitions. Second operand has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:27,281 INFO L93 Difference]: Finished difference Result 677 states and 880 transitions. [2025-04-29 10:51:27,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:51:27,282 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-04-29 10:51:27,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:27,283 INFO L225 Difference]: With dead ends: 677 [2025-04-29 10:51:27,283 INFO L226 Difference]: Without dead ends: 517 [2025-04-29 10:51:27,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 10:51:27,284 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 107 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:27,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1198 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 10:51:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-29 10:51:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 464. [2025-04-29 10:51:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 453 states have (on average 1.3002207505518764) internal successors, (589), 455 states have internal predecessors, (589), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:51:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 602 transitions. [2025-04-29 10:51:27,411 INFO L79 Accepts]: Start accepts. Automaton has 464 states and 602 transitions. Word has length 50 [2025-04-29 10:51:27,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:27,412 INFO L485 AbstractCegarLoop]: Abstraction has 464 states and 602 transitions. [2025-04-29 10:51:27,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:51:27,412 INFO L278 IsEmpty]: Start isEmpty. Operand 464 states and 602 transitions. [2025-04-29 10:51:27,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 10:51:27,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:27,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:27,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-29 10:51:27,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-29 10:51:27,614 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:27,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1982103351, now seen corresponding path program 1 times [2025-04-29 10:51:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:27,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973501500] [2025-04-29 10:51:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:27,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 10:51:27,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 10:51:27,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:51:28,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:28,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973501500] [2025-04-29 10:51:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973501500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:51:28,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707825350] [2025-04-29 10:51:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:28,102 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:28,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-29 10:51:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 10:51:28,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 10:51:28,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:28,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:28,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 10:51:28,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:32,343 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~pat~0#1.base_BEFORE_CALL_1| Int)) (= (select (select |c_#memory_int#0| |v_ULTIMATE.start_main_~pat~0#1.base_BEFORE_CALL_1|) 0) (select (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|) 0))) is different from true [2025-04-29 10:51:32,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-29 10:51:32,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:51:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:32,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:32,655 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:51:32,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2025-04-29 10:51:32,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:51:32,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2025-04-29 10:51:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:51:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707825350] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:32,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 10] total 35 [2025-04-29 10:51:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016365271] [2025-04-29 10:51:32,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:32,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 10:51:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:32,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 10:51:32,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1024, Unknown=1, NotChecked=64, Total=1190 [2025-04-29 10:51:32,734 INFO L87 Difference]: Start difference. First operand 464 states and 602 transitions. Second operand has 35 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 35 states have internal predecessors, (88), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-04-29 10:51:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:35,242 INFO L93 Difference]: Finished difference Result 687 states and 894 transitions. [2025-04-29 10:51:35,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-29 10:51:35,243 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 35 states have internal predecessors, (88), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 53 [2025-04-29 10:51:35,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:35,244 INFO L225 Difference]: With dead ends: 687 [2025-04-29 10:51:35,244 INFO L226 Difference]: Without dead ends: 612 [2025-04-29 10:51:35,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=707, Invalid=5776, Unknown=1, NotChecked=158, Total=6642 [2025-04-29 10:51:35,245 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 235 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:35,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1247 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1592 Invalid, 0 Unknown, 408 Unchecked, 0.8s Time] [2025-04-29 10:51:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-04-29 10:51:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 497. [2025-04-29 10:51:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 481 states have (on average 1.2806652806652807) internal successors, (616), 484 states have internal predecessors, (616), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 10:51:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 637 transitions. [2025-04-29 10:51:35,347 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 637 transitions. Word has length 53 [2025-04-29 10:51:35,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:35,347 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 637 transitions. [2025-04-29 10:51:35,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 35 states have internal predecessors, (88), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-04-29 10:51:35,347 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 637 transitions. [2025-04-29 10:51:35,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 10:51:35,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:35,348 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2025-04-29 10:51:35,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-29 10:51:35,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-29 10:51:35,548 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:35,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -842408720, now seen corresponding path program 3 times [2025-04-29 10:51:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:35,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277919475] [2025-04-29 10:51:35,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:51:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:35,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-04-29 10:51:35,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 10:51:35,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:51:35,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15