./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.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 b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:59:53,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:59:53,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:59:53,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:59:53,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:59:53,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:59:53,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:59:53,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:59:53,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:59:53,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:59:53,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:59:53,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:59:53,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:59:53,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:59:53,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:59:53,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:59:53,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:59:53,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:59:53,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:59:53,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:59:53,430 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 -> b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 [2025-03-03 19:59:53,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:59:53,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:59:53,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:59:53,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:59:53,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:59:53,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2025-03-03 19:59:54,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7f37498/82801221e1354a19b9fafe4a919df0bd/FLAG7b666ffa0 [2025-03-03 19:59:55,121 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:59:55,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2025-03-03 19:59:55,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7f37498/82801221e1354a19b9fafe4a919df0bd/FLAG7b666ffa0 [2025-03-03 19:59:55,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7f37498/82801221e1354a19b9fafe4a919df0bd [2025-03-03 19:59:55,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:59:55,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:59:55,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:59:55,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:59:55,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:59:55,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53226c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55, skipping insertion in model container [2025-03-03 19:59:55,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:59:55,564 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_ps-cn-25_file-59.i[915,928] [2025-03-03 19:59:55,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:59:55,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:59:55,618 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_ps-cn-25_file-59.i[915,928] [2025-03-03 19:59:55,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:59:55,669 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:59:55,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55 WrapperNode [2025-03-03 19:59:55,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:59:55,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:59:55,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:59:55,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:59:55,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,715 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-03-03 19:59:55,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:59:55,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:59:55,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:59:55,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:59:55,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:59:55,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:59:55,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:59:55,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:59:55,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:59:55,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (1/1) ... [2025-03-03 19:59:55,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:59:55,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:59:55,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:59:55,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:59:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:59:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:59:55,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:59:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:59:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:59:55,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:59:55,884 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:59:55,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:59:56,229 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:59:56,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:59:56,240 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:59:56,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:59:56,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:59:56 BoogieIcfgContainer [2025-03-03 19:59:56,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:59:56,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:59:56,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:59:56,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:59:56,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:59:55" (1/3) ... [2025-03-03 19:59:56,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c86bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:59:56, skipping insertion in model container [2025-03-03 19:59:56,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:59:55" (2/3) ... [2025-03-03 19:59:56,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c86bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:59:56, skipping insertion in model container [2025-03-03 19:59:56,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:59:56" (3/3) ... [2025-03-03 19:59:56,248 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2025-03-03 19:59:56,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:59:56,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:59:56,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:59:56,309 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;@6cd547f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:59:56,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:59:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:59:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:59:56,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:56,321 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:56,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1422691860, now seen corresponding path program 1 times [2025-03-03 19:59:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645021733] [2025-03-03 19:59:56,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:56,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:59:56,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:59:56,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:56,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:59:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645021733] [2025-03-03 19:59:56,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645021733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:59:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315897446] [2025-03-03 19:59:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:56,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:59:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:59:56,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:59:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:59:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:59:56,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:59:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:56,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:59:56,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:59:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:59:56,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:59:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315897446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:59:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:59:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421912061] [2025-03-03 19:59:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:56,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:59:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:56,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:59:56,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:59:56,790 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:59:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:56,816 INFO L93 Difference]: Finished difference Result 164 states and 286 transitions. [2025-03-03 19:59:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:59:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-03 19:59:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:56,821 INFO L225 Difference]: With dead ends: 164 [2025-03-03 19:59:56,822 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 19:59:56,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:59:56,825 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:56,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:59:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 19:59:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 19:59:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:59:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-03-03 19:59:56,856 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 175 [2025-03-03 19:59:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:56,856 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-03-03 19:59:56,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:59:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-03-03 19:59:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:59:56,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:56,858 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:59:57,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:59:57,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1076924465, now seen corresponding path program 1 times [2025-03-03 19:59:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306385209] [2025-03-03 19:59:57,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:57,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:59:57,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:59:57,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:57,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:57,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:57,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306385209] [2025-03-03 19:59:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306385209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:59:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723574130] [2025-03-03 19:59:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:59:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:57,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:59:57,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:59:57,439 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:57,575 INFO L93 Difference]: Finished difference Result 225 states and 343 transitions. [2025-03-03 19:59:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:59:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:59:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:57,578 INFO L225 Difference]: With dead ends: 225 [2025-03-03 19:59:57,579 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 19:59:57,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:59:57,582 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 96 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:57,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 307 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:59:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 19:59:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-03-03 19:59:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 19:59:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2025-03-03 19:59:57,601 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 175 [2025-03-03 19:59:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:57,602 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2025-03-03 19:59:57,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2025-03-03 19:59:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:59:57,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:57,609 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:57,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:59:57,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1582483090, now seen corresponding path program 1 times [2025-03-03 19:59:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748549166] [2025-03-03 19:59:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:57,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:59:57,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:59:57,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:57,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:57,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748549166] [2025-03-03 19:59:57,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748549166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:57,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:59:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906413692] [2025-03-03 19:59:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:59:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:57,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:59:57,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:59:57,844 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:57,888 INFO L93 Difference]: Finished difference Result 422 states and 647 transitions. [2025-03-03 19:59:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:59:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:59:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:57,896 INFO L225 Difference]: With dead ends: 422 [2025-03-03 19:59:57,897 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 19:59:57,897 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-03 19:59:57,898 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:57,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:59:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 19:59:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2025-03-03 19:59:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 183 states have internal predecessors, (241), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:59:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 429 transitions. [2025-03-03 19:59:57,953 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 429 transitions. Word has length 175 [2025-03-03 19:59:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:57,953 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 429 transitions. [2025-03-03 19:59:57,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 429 transitions. [2025-03-03 19:59:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:59:57,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:57,959 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:57,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:59:57,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:57,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1036881266, now seen corresponding path program 1 times [2025-03-03 19:59:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237762652] [2025-03-03 19:59:57,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:57,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:59:58,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:59:58,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:58,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237762652] [2025-03-03 19:59:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237762652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:58,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:59:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402719192] [2025-03-03 19:59:58,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:59:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:58,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:59:58,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:59:58,123 INFO L87 Difference]: Start difference. First operand 280 states and 429 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:58,167 INFO L93 Difference]: Finished difference Result 557 states and 855 transitions. [2025-03-03 19:59:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:59:58,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 19:59:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:58,171 INFO L225 Difference]: With dead ends: 557 [2025-03-03 19:59:58,172 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 19:59:58,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03 19:59:58,174 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:58,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:59:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 19:59:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2025-03-03 19:59:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 182 states have internal predecessors, (236), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:59:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2025-03-03 19:59:58,215 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 176 [2025-03-03 19:59:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:58,215 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2025-03-03 19:59:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2025-03-03 19:59:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:59:58,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:58,218 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:59:58,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1542439891, now seen corresponding path program 1 times [2025-03-03 19:59:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152404829] [2025-03-03 19:59:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:58,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:59:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:59:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152404829] [2025-03-03 19:59:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152404829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:59:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149940574] [2025-03-03 19:59:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:59:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:59:58,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:59:58,448 INFO L87 Difference]: Start difference. First operand 279 states and 424 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:58,607 INFO L93 Difference]: Finished difference Result 687 states and 1040 transitions. [2025-03-03 19:59:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:59:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 19:59:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:58,612 INFO L225 Difference]: With dead ends: 687 [2025-03-03 19:59:58,612 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 19:59:58,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:59:58,613 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:58,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 353 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:59:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 19:59:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 358. [2025-03-03 19:59:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 232 states have internal predecessors, (292), 121 states have call successors, (121), 6 states have call predecessors, (121), 6 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-03 19:59:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 534 transitions. [2025-03-03 19:59:58,668 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 534 transitions. Word has length 176 [2025-03-03 19:59:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:58,670 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 534 transitions. [2025-03-03 19:59:58,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 534 transitions. [2025-03-03 19:59:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 19:59:58,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:58,671 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:59:58,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 509400824, now seen corresponding path program 1 times [2025-03-03 19:59:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94881306] [2025-03-03 19:59:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:58,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 19:59:58,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 19:59:58,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:58,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94881306] [2025-03-03 19:59:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94881306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:59:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508821831] [2025-03-03 19:59:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:58,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:59:58,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:58,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:59:58,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:59:58,913 INFO L87 Difference]: Start difference. First operand 358 states and 534 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:58,983 INFO L93 Difference]: Finished difference Result 909 states and 1348 transitions. [2025-03-03 19:59:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:59:58,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-03 19:59:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:58,988 INFO L225 Difference]: With dead ends: 909 [2025-03-03 19:59:58,989 INFO L226 Difference]: Without dead ends: 610 [2025-03-03 19:59:58,990 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-03 19:59:58,991 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 87 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 281 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:59:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-03 19:59:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2025-03-03 19:59:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 408 states have (on average 1.2818627450980393) internal successors, (523), 414 states have internal predecessors, (523), 185 states have call successors, (185), 10 states have call predecessors, (185), 10 states have return successors, (185), 179 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-03 19:59:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 893 transitions. [2025-03-03 19:59:59,060 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 893 transitions. Word has length 177 [2025-03-03 19:59:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:59,061 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 893 transitions. [2025-03-03 19:59:59,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 893 transitions. [2025-03-03 19:59:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 19:59:59,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:59,063 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:59,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:59:59,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:59,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -335071047, now seen corresponding path program 1 times [2025-03-03 19:59:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:59,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713283752] [2025-03-03 19:59:59,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:59,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 19:59:59,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 19:59:59,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:59:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:59:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:59:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713283752] [2025-03-03 19:59:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713283752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:59:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:59:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:59:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860435821] [2025-03-03 19:59:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:59:59,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:59:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:59:59,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:59:59,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:59:59,246 INFO L87 Difference]: Start difference. First operand 604 states and 893 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:59:59,446 INFO L93 Difference]: Finished difference Result 1666 states and 2488 transitions. [2025-03-03 19:59:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:59:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-03 19:59:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:59:59,452 INFO L225 Difference]: With dead ends: 1666 [2025-03-03 19:59:59,453 INFO L226 Difference]: Without dead ends: 1168 [2025-03-03 19:59:59,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:59:59,455 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 100 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:59:59,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 351 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:59:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-03 19:59:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1100. [2025-03-03 19:59:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 738 states have (on average 1.2777777777777777) internal successors, (943), 750 states have internal predecessors, (943), 343 states have call successors, (343), 18 states have call predecessors, (343), 18 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-03 19:59:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1629 transitions. [2025-03-03 19:59:59,588 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1629 transitions. Word has length 177 [2025-03-03 19:59:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:59:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1629 transitions. [2025-03-03 19:59:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:59:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1629 transitions. [2025-03-03 19:59:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 19:59:59,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:59:59,592 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:59:59,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:59:59,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:59:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:59:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash 971293612, now seen corresponding path program 1 times [2025-03-03 19:59:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:59:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738022849] [2025-03-03 19:59:59,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:59:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:59:59,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 19:59:59,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 19:59:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:59:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:00:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 20:00:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:00:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738022849] [2025-03-03 20:00:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738022849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:00:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282544544] [2025-03-03 20:00:00,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:00:00,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:00:00,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:00:00,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:00:00,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:00:00,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 20:00:00,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 20:00:00,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:00:00,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:00:00,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 20:00:00,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:00:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-03-03 20:00:01,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:00:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 20:00:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282544544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:00:01,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:00:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2025-03-03 20:00:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067670256] [2025-03-03 20:00:01,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:00:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 20:00:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:00:01,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 20:00:01,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:00:01,839 INFO L87 Difference]: Start difference. First operand 1100 states and 1629 transitions. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2025-03-03 20:00:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:00:02,944 INFO L93 Difference]: Finished difference Result 2634 states and 3854 transitions. [2025-03-03 20:00:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 20:00:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) Word has length 178 [2025-03-03 20:00:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:00:02,955 INFO L225 Difference]: With dead ends: 2634 [2025-03-03 20:00:02,956 INFO L226 Difference]: Without dead ends: 1640 [2025-03-03 20:00:02,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 20:00:02,961 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 412 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:00:02,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 748 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:00:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-03 20:00:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1366. [2025-03-03 20:00:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 951 states have (on average 1.2618296529968454) internal successors, (1200), 975 states have internal predecessors, (1200), 379 states have call successors, (379), 35 states have call predecessors, (379), 35 states have return successors, (379), 355 states have call predecessors, (379), 379 states have call successors, (379) [2025-03-03 20:00:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1958 transitions. [2025-03-03 20:00:03,083 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1958 transitions. Word has length 178 [2025-03-03 20:00:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:00:03,083 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1958 transitions. [2025-03-03 20:00:03,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2025-03-03 20:00:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1958 transitions. [2025-03-03 20:00:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 20:00:03,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:00:03,085 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:00:03,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:00:03,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 20:00:03,290 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:00:03,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:00:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1264696619, now seen corresponding path program 1 times [2025-03-03 20:00:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:00:03,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13972878] [2025-03-03 20:00:03,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:00:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:00:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 20:00:03,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 20:00:03,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:00:03,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:00:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453663663] [2025-03-03 20:00:03,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:00:03,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:00:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:00:03,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:00:03,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:00:03,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 20:00:03,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 20:00:03,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:00:03,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:00:03,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 20:00:03,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:00:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-03 20:00:05,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:00:15,134 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 20:00:39,975 WARN L286 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 20:01:01,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2025-03-03 20:01:15,205 WARN L286 SmtUtils]: Spent 9.73s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 20:01:29,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod c_~var_1_17~0 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false