./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:34:35,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:34:35,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:34:35,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:34:35,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:34:35,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:34:35,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:34:35,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:34:35,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:34:35,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:34:35,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:34:35,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:34:35,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:34:35,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:34:35,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:34:35,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:34:35,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:34:35,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:34:35,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:34:35,222 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 -> 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da [2025-03-16 23:34:35,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:34:35,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:34:35,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:34:35,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:34:35,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:34:35,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2025-03-16 23:34:36,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e5247bb/b4adef25cd6e4bb382fb8d06730656b9/FLAGc736f8f10 [2025-03-16 23:34:36,822 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:34:36,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2025-03-16 23:34:36,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e5247bb/b4adef25cd6e4bb382fb8d06730656b9/FLAGc736f8f10 [2025-03-16 23:34:37,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e5247bb/b4adef25cd6e4bb382fb8d06730656b9 [2025-03-16 23:34:37,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:34:37,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:34:37,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:34:37,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:34:37,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:34:37,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2ebbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37, skipping insertion in model container [2025-03-16 23:34:37,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:34:37,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i[913,926] [2025-03-16 23:34:37,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:34:37,364 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:34:37,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i[913,926] [2025-03-16 23:34:37,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:34:37,427 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:34:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37 WrapperNode [2025-03-16 23:34:37,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:34:37,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:34:37,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:34:37,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:34:37,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,469 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-16 23:34:37,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:34:37,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:34:37,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:34:37,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:34:37,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,505 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:34:37,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:34:37,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:34:37,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:34:37,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:34:37,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (1/1) ... [2025-03-16 23:34:37,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:34:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:34:37,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:34:37,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:34:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:34:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:34:37,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:34:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:34:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:34:37,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:34:37,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:34:37,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:34:37,840 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 23:34:37,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:34:37,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:34:37,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:34:37,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:34:37 BoogieIcfgContainer [2025-03-16 23:34:37,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:34:37,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:34:37,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:34:37,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:34:37,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:34:37" (1/3) ... [2025-03-16 23:34:37,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60508200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:34:37, skipping insertion in model container [2025-03-16 23:34:37,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:34:37" (2/3) ... [2025-03-16 23:34:37,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60508200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:34:37, skipping insertion in model container [2025-03-16 23:34:37,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:34:37" (3/3) ... [2025-03-16 23:34:37,858 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-66.i [2025-03-16 23:34:37,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:34:37,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-66.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:34:37,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:34:37,912 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20deea4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:34:37,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:34:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:34:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:34:37,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:34:37,924 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:34:37,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:34:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:34:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash -871327324, now seen corresponding path program 1 times [2025-03-16 23:34:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:34:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14477530] [2025-03-16 23:34:37,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:34:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:34:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:34:38,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:34:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:34:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:34:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:34:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:34:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14477530] [2025-03-16 23:34:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14477530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:34:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513971748] [2025-03-16 23:34:38,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:34:38,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:34:38,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:34:38,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:34:38,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:34:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:34:38,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:34:38,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:34:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:34:38,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:34:38,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:34:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:34:38,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:34:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513971748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:34:38,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:34:38,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:34:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991673872] [2025-03-16 23:34:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:34:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:34:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:34:38,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:34:38,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:34:38,302 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:34:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:34:38,317 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2025-03-16 23:34:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:34:38,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-03-16 23:34:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:34:38,325 INFO L225 Difference]: With dead ends: 107 [2025-03-16 23:34:38,325 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 23:34:38,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:34:38,330 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:34:38,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:34:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 23:34:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 23:34:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:34:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2025-03-16 23:34:38,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 115 [2025-03-16 23:34:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:34:38,358 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2025-03-16 23:34:38,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:34:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2025-03-16 23:34:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:34:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:34:38,363 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:34:38,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:34:38,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:34:38,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:34:38,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:34:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash 369067268, now seen corresponding path program 1 times [2025-03-16 23:34:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:34:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071676223] [2025-03-16 23:34:38,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:34:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:34:38,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:34:38,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:34:38,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:34:38,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:34:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:34:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:34:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071676223] [2025-03-16 23:34:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071676223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:34:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:34:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:34:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593131413] [2025-03-16 23:34:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:34:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:34:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:34:42,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:34:42,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:34:42,116 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:34:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:34:42,704 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2025-03-16 23:34:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:34:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:34:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:34:42,707 INFO L225 Difference]: With dead ends: 212 [2025-03-16 23:34:42,707 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 23:34:42,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:34:42,708 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 183 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:34:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 334 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:34:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 23:34:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2025-03-16 23:34:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:34:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 145 transitions. [2025-03-16 23:34:42,728 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 145 transitions. Word has length 115 [2025-03-16 23:34:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:34:42,728 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 145 transitions. [2025-03-16 23:34:42,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:34:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2025-03-16 23:34:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:34:42,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:34:42,731 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:34:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:34:42,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:34:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:34:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 369097059, now seen corresponding path program 1 times [2025-03-16 23:34:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:34:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812867363] [2025-03-16 23:34:42,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:34:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:34:42,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:34:42,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:34:42,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:34:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812867363] [2025-03-16 23:35:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812867363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:35:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374177280] [2025-03-16 23:35:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:35:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:35:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:35:06,832 INFO L87 Difference]: Start difference. First operand 95 states and 145 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:08,751 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2025-03-16 23:35:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:35:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:08,754 INFO L225 Difference]: With dead ends: 147 [2025-03-16 23:35:08,754 INFO L226 Difference]: Without dead ends: 145 [2025-03-16 23:35:08,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:35:08,755 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 143 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:08,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 314 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:35:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-16 23:35:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2025-03-16 23:35:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:35:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2025-03-16 23:35:08,766 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 115 [2025-03-16 23:35:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:08,767 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2025-03-16 23:35:08,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2025-03-16 23:35:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:08,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:08,768 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:08,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:35:08,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2111877603, now seen corresponding path program 1 times [2025-03-16 23:35:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248163006] [2025-03-16 23:35:08,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:08,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:08,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:08,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:08,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248163006] [2025-03-16 23:35:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248163006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:35:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068197750] [2025-03-16 23:35:11,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:35:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:11,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:35:11,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:35:11,070 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:11,617 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2025-03-16 23:35:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:35:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:11,618 INFO L225 Difference]: With dead ends: 166 [2025-03-16 23:35:11,618 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 23:35:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:35:11,619 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:11,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 336 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:35:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 23:35:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 102. [2025-03-16 23:35:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:35:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-16 23:35:11,631 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 115 [2025-03-16 23:35:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:11,632 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-16 23:35:11,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-16 23:35:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:11,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:11,635 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:11,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:35:11,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2111907394, now seen corresponding path program 1 times [2025-03-16 23:35:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282902121] [2025-03-16 23:35:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:11,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:11,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:11,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:11,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282902121] [2025-03-16 23:35:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282902121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:35:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812667868] [2025-03-16 23:35:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:35:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:39,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:35:39,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:35:39,867 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:42,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 23:35:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:43,503 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2025-03-16 23:35:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:35:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:43,505 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:35:43,505 INFO L226 Difference]: Without dead ends: 149 [2025-03-16 23:35:43,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:35:43,505 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 118 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:43,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 456 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 23:35:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-16 23:35:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2025-03-16 23:35:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:35:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2025-03-16 23:35:43,518 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 115 [2025-03-16 23:35:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:43,518 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2025-03-16 23:35:43,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2025-03-16 23:35:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:43,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:43,520 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:35:43,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1427884091, now seen corresponding path program 1 times [2025-03-16 23:35:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:43,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406870916] [2025-03-16 23:35:43,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:43,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:43,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:43,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:43,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:43,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:43,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406870916] [2025-03-16 23:35:43,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406870916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:43,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:43,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:35:43,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650472949] [2025-03-16 23:35:43,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:43,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:35:43,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:43,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:35:43,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:35:43,557 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:43,603 INFO L93 Difference]: Finished difference Result 271 states and 414 transitions. [2025-03-16 23:35:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:35:43,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:43,606 INFO L225 Difference]: With dead ends: 271 [2025-03-16 23:35:43,606 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 23:35:43,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:35:43,608 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:43,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 212 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:35:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 23:35:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-16 23:35:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 125 states have internal predecessors, (167), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:35:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2025-03-16 23:35:43,635 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 115 [2025-03-16 23:35:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:43,636 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2025-03-16 23:35:43,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2025-03-16 23:35:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:43,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:43,637 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:43,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:35:43,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:43,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash -540380410, now seen corresponding path program 1 times [2025-03-16 23:35:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249578633] [2025-03-16 23:35:43,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:43,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:43,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:43,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249578633] [2025-03-16 23:35:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249578633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:35:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513422648] [2025-03-16 23:35:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:35:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:43,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:35:43,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:35:43,715 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:43,883 INFO L93 Difference]: Finished difference Result 507 states and 740 transitions. [2025-03-16 23:35:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:35:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:43,886 INFO L225 Difference]: With dead ends: 507 [2025-03-16 23:35:43,886 INFO L226 Difference]: Without dead ends: 336 [2025-03-16 23:35:43,887 INFO L434 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-03-16 23:35:43,887 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 66 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:43,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 245 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:35:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-16 23:35:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 295. [2025-03-16 23:35:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 202 states have (on average 1.3217821782178218) internal successors, (267), 205 states have internal predecessors, (267), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-16 23:35:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 435 transitions. [2025-03-16 23:35:43,916 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 435 transitions. Word has length 115 [2025-03-16 23:35:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:43,916 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 435 transitions. [2025-03-16 23:35:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 435 transitions. [2025-03-16 23:35:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:43,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:43,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:43,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:35:43,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:43,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1202429925, now seen corresponding path program 1 times [2025-03-16 23:35:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:43,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135811392] [2025-03-16 23:35:43,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:43,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135811392] [2025-03-16 23:35:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135811392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:35:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30748750] [2025-03-16 23:35:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:35:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:35:46,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:35:46,569 INFO L87 Difference]: Start difference. First operand 295 states and 435 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-16 23:35:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:47,972 INFO L93 Difference]: Finished difference Result 429 states and 590 transitions. [2025-03-16 23:35:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:35:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 115 [2025-03-16 23:35:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:47,975 INFO L225 Difference]: With dead ends: 429 [2025-03-16 23:35:47,976 INFO L226 Difference]: Without dead ends: 427 [2025-03-16 23:35:47,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:35:47,977 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 307 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:47,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 420 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:35:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-16 23:35:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 346. [2025-03-16 23:35:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-16 23:35:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 499 transitions. [2025-03-16 23:35:48,010 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 499 transitions. Word has length 115 [2025-03-16 23:35:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:48,010 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 499 transitions. [2025-03-16 23:35:48,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-16 23:35:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 499 transitions. [2025-03-16 23:35:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:48,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:48,011 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:48,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:35:48,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1202459716, now seen corresponding path program 1 times [2025-03-16 23:35:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193150989] [2025-03-16 23:35:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:48,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193150989] [2025-03-16 23:35:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193150989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:35:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581440891] [2025-03-16 23:35:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:50,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:35:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:50,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:35:50,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:35:50,242 INFO L87 Difference]: Start difference. First operand 346 states and 499 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:51,300 INFO L93 Difference]: Finished difference Result 427 states and 588 transitions. [2025-03-16 23:35:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:35:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-16 23:35:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:51,303 INFO L225 Difference]: With dead ends: 427 [2025-03-16 23:35:51,303 INFO L226 Difference]: Without dead ends: 425 [2025-03-16 23:35:51,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:35:51,304 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 254 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:51,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 391 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:35:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-16 23:35:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 346. [2025-03-16 23:35:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-16 23:35:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 499 transitions. [2025-03-16 23:35:51,344 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 499 transitions. Word has length 115 [2025-03-16 23:35:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:51,345 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 499 transitions. [2025-03-16 23:35:51,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 23:35:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 499 transitions. [2025-03-16 23:35:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 23:35:51,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:51,346 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:51,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:35:51,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:51,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash 498149987, now seen corresponding path program 1 times [2025-03-16 23:35:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421280197] [2025-03-16 23:35:51,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 23:35:51,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 23:35:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 23:35:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:51,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421280197] [2025-03-16 23:35:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421280197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:35:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:35:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890446663] [2025-03-16 23:35:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:51,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:35:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:51,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:35:51,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:35:51,521 INFO L87 Difference]: Start difference. First operand 346 states and 499 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:35:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:51,753 INFO L93 Difference]: Finished difference Result 656 states and 934 transitions. [2025-03-16 23:35:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:35:51,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-03-16 23:35:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:51,756 INFO L225 Difference]: With dead ends: 656 [2025-03-16 23:35:51,756 INFO L226 Difference]: Without dead ends: 353 [2025-03-16 23:35:51,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:35:51,757 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 118 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:51,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 152 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:35:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-16 23:35:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2025-03-16 23:35:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 239 states have internal predecessors, (294), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-16 23:35:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 486 transitions. [2025-03-16 23:35:51,795 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 486 transitions. Word has length 115 [2025-03-16 23:35:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 486 transitions. [2025-03-16 23:35:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:35:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 486 transitions. [2025-03-16 23:35:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 23:35:51,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:51,796 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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-03-16 23:35:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:35:51,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1087895748, now seen corresponding path program 1 times [2025-03-16 23:35:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696828967] [2025-03-16 23:35:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:51,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 23:35:51,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 23:35:51,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:51,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:35:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492589244] [2025-03-16 23:35:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:35:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:51,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:35:51,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:35:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 23:35:52,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 23:35:52,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:52,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:52,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 23:35:52,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:35:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 400 proven. 102 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 23:35:54,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:36:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:36:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696828967] [2025-03-16 23:36:05,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:36:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492589244] [2025-03-16 23:36:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492589244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:36:05,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:36:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-16 23:36:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771100929] [2025-03-16 23:36:05,531 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 23:36:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 23:36:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:36:05,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 23:36:05,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=506, Unknown=2, NotChecked=0, Total=650 [2025-03-16 23:36:05,532 INFO L87 Difference]: Start difference. First operand 344 states and 486 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 7 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18)