./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 87d97b8e30b2a31a4876e057488e2e87126da257ca4324c4e70a282f34f137aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:59:49,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:59:49,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:59:49,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:59:49,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:59:49,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:59:49,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:59:49,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:59:49,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:59:49,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:59:49,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:59:49,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:59:49,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:59:49,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:59:49,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:59:49,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:59:49,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:59:49,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:59:49,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:59:49,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:59:49,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:59:49,558 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-jdk21/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 -> 87d97b8e30b2a31a4876e057488e2e87126da257ca4324c4e70a282f34f137aa [2025-01-09 08:59:49,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:59:49,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:59:49,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:59:49,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:59:49,790 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:59:49,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i [2025-01-09 08:59:50,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e1c25c/72d90d919a6b4a708620f1be14a1a8b2/FLAG86ae01c19 [2025-01-09 08:59:51,271 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:59:51,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i [2025-01-09 08:59:51,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e1c25c/72d90d919a6b4a708620f1be14a1a8b2/FLAG86ae01c19 [2025-01-09 08:59:51,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e1c25c/72d90d919a6b4a708620f1be14a1a8b2 [2025-01-09 08:59:51,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:59:51,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:59:51,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:59:51,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:59:51,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:59:51,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7956c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51, skipping insertion in model container [2025-01-09 08:59:51,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:59:51,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i[917,930] [2025-01-09 08:59:51,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:59:51,729 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:59:51,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-81.i[917,930] [2025-01-09 08:59:51,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:59:51,772 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:59:51,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51 WrapperNode [2025-01-09 08:59:51,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:59:51,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:59:51,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:59:51,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:59:51,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,815 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-01-09 08:59:51,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:59:51,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:59:51,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:59:51,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:59:51,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,863 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-01-09 08:59:51,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:59:51,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:59:51,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:59:51,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:59:51,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (1/1) ... [2025-01-09 08:59:51,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:59:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:59:51,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:59:51,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:59:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:59:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:59:51,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:59:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:59:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:59:51,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:59:52,014 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:59:52,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:59:52,296 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 08:59:52,296 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:59:52,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:59:52,306 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:59:52,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:52 BoogieIcfgContainer [2025-01-09 08:59:52,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:59:52,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:59:52,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:59:52,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:59:52,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:59:51" (1/3) ... [2025-01-09 08:59:52,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5390e6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:52, skipping insertion in model container [2025-01-09 08:59:52,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:51" (2/3) ... [2025-01-09 08:59:52,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5390e6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:52, skipping insertion in model container [2025-01-09 08:59:52,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:52" (3/3) ... [2025-01-09 08:59:52,315 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-81.i [2025-01-09 08:59:52,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:59:52,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-81.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:59:52,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:59:52,408 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;@35587db5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:59:52,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:59:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 08:59:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:59:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:59:52,423 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:59:52,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:59:52,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:59:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2069166002, now seen corresponding path program 1 times [2025-01-09 08:59:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:59:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817011278] [2025-01-09 08:59:52,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:59:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:59:52,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:59:52,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:59:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:59:52,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:59:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 08:59:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:59:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817011278] [2025-01-09 08:59:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817011278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:59:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616489644] [2025-01-09 08:59:52,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:59:52,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:59:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:59:52,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:59:52,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:59:52,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:59:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:59:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:59:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:59:52,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:59:52,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:59:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 08:59:52,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:59:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616489644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:59:52,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:59:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:59:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030347907] [2025-01-09 08:59:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:59:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:59:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:59:53,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:59:53,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:59:53,018 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:59:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:59:53,039 INFO L93 Difference]: Finished difference Result 166 states and 291 transitions. [2025-01-09 08:59:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:59:53,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 197 [2025-01-09 08:59:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:59:53,048 INFO L225 Difference]: With dead ends: 166 [2025-01-09 08:59:53,049 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 08:59:53,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-01-09 08:59:53,055 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:59:53,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:59:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 08:59:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 08:59:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 08:59:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-01-09 08:59:53,098 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 197 [2025-01-09 08:59:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:59:53,098 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-01-09 08:59:53,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:59:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-01-09 08:59:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:59:53,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:59:53,104 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:59:53,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:59:53,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 08:59:53,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:59:53,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:59:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1714473038, now seen corresponding path program 1 times [2025-01-09 08:59:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:59:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037176743] [2025-01-09 08:59:53,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:59:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:59:53,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:59:53,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:59:53,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:59:53,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:59:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:59:53,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:59:53,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037176743] [2025-01-09 08:59:53,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037176743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:59:53,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:59:53,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:59:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036849383] [2025-01-09 08:59:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:59:53,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:59:53,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:59:53,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:59:53,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:59:53,961 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:59:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:59:54,191 INFO L93 Difference]: Finished difference Result 244 states and 377 transitions. [2025-01-09 08:59:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:59:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 08:59:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:59:54,197 INFO L225 Difference]: With dead ends: 244 [2025-01-09 08:59:54,197 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 08:59:54,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:59:54,200 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:59:54,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 300 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:59:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 08:59:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-01-09 08:59:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 08:59:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2025-01-09 08:59:54,256 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 197 [2025-01-09 08:59:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:59:54,257 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2025-01-09 08:59:54,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:59:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2025-01-09 08:59:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:59:54,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:59:54,263 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:59:54,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:59:54,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:59:54,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:59:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash -693404684, now seen corresponding path program 1 times [2025-01-09 08:59:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:59:54,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773986252] [2025-01-09 08:59:54,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:59:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:59:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:59:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:59:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:59:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773986252] [2025-01-09 09:00:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773986252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:02,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:00:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633145891] [2025-01-09 09:00:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:02,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:00:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:02,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:00:02,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:00:02,550 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:03,235 INFO L93 Difference]: Finished difference Result 386 states and 574 transitions. [2025-01-09 09:00:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:00:03,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 09:00:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:03,239 INFO L225 Difference]: With dead ends: 386 [2025-01-09 09:00:03,239 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 09:00:03,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:00:03,240 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 246 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:03,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 709 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:00:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 09:00:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 230. [2025-01-09 09:00:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 151 states have internal predecessors, (198), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 09:00:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2025-01-09 09:00:03,267 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 197 [2025-01-09 09:00:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2025-01-09 09:00:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2025-01-09 09:00:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 09:00:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:03,270 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:00:03,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1280210698, now seen corresponding path program 1 times [2025-01-09 09:00:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582302544] [2025-01-09 09:00:03,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 09:00:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 09:00:03,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:03,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:10,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582302544] [2025-01-09 09:00:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582302544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:00:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288155316] [2025-01-09 09:00:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:10,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:00:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:10,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:00:10,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:00:10,673 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:11,369 INFO L93 Difference]: Finished difference Result 397 states and 593 transitions. [2025-01-09 09:00:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:00:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 09:00:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:11,377 INFO L225 Difference]: With dead ends: 397 [2025-01-09 09:00:11,377 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 09:00:11,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:00:11,378 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 121 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:11,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 753 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:00:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 09:00:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2025-01-09 09:00:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 147 states have internal predecessors, (192), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 09:00:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 344 transitions. [2025-01-09 09:00:11,407 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 344 transitions. Word has length 197 [2025-01-09 09:00:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:11,407 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 344 transitions. [2025-01-09 09:00:11,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 344 transitions. [2025-01-09 09:00:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:11,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:11,410 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:00:11,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1602546504, now seen corresponding path program 1 times [2025-01-09 09:00:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537197606] [2025-01-09 09:00:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:11,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:11,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:11,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:11,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537197606] [2025-01-09 09:00:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537197606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:11,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:00:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321031765] [2025-01-09 09:00:11,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:11,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:00:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:11,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:00:11,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:00:11,461 INFO L87 Difference]: Start difference. First operand 226 states and 344 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:11,500 INFO L93 Difference]: Finished difference Result 552 states and 836 transitions. [2025-01-09 09:00:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:00:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:11,505 INFO L225 Difference]: With dead ends: 552 [2025-01-09 09:00:11,505 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 09:00:11,506 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-01-09 09:00:11,507 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:11,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 268 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:00:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 09:00:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2025-01-09 09:00:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 225 states have (on average 1.3155555555555556) internal successors, (296), 230 states have internal predecessors, (296), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 09:00:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 500 transitions. [2025-01-09 09:00:11,530 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 500 transitions. Word has length 198 [2025-01-09 09:00:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:11,531 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 500 transitions. [2025-01-09 09:00:11,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 500 transitions. [2025-01-09 09:00:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:11,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:11,532 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:11,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:00:11,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1883074166, now seen corresponding path program 1 times [2025-01-09 09:00:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82162104] [2025-01-09 09:00:11,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:11,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:11,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82162104] [2025-01-09 09:00:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82162104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:00:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618399168] [2025-01-09 09:00:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:00:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:15,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:00:15,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:00:15,398 INFO L87 Difference]: Start difference. First operand 335 states and 500 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:15,754 INFO L93 Difference]: Finished difference Result 783 states and 1153 transitions. [2025-01-09 09:00:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:00:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:15,761 INFO L225 Difference]: With dead ends: 783 [2025-01-09 09:00:15,761 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 09:00:15,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:00:15,763 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:15,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 454 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:00:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 09:00:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 366. [2025-01-09 09:00:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 256 states have (on average 1.32421875) internal successors, (339), 261 states have internal predecessors, (339), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 09:00:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 543 transitions. [2025-01-09 09:00:15,801 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 543 transitions. Word has length 198 [2025-01-09 09:00:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:15,802 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 543 transitions. [2025-01-09 09:00:15,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 543 transitions. [2025-01-09 09:00:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:15,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:15,804 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:00:15,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 871956916, now seen corresponding path program 1 times [2025-01-09 09:00:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284126027] [2025-01-09 09:00:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:15,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:15,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284126027] [2025-01-09 09:00:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284126027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:00:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220119571] [2025-01-09 09:00:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:19,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:00:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:19,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:00:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:00:19,539 INFO L87 Difference]: Start difference. First operand 366 states and 543 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:19,896 INFO L93 Difference]: Finished difference Result 775 states and 1145 transitions. [2025-01-09 09:00:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:00:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:19,900 INFO L225 Difference]: With dead ends: 775 [2025-01-09 09:00:19,900 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 09:00:19,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:00:19,901 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 170 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:19,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 307 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:00:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 09:00:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 359. [2025-01-09 09:00:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 249 states have (on average 1.321285140562249) internal successors, (329), 254 states have internal predecessors, (329), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 09:00:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2025-01-09 09:00:19,928 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 198 [2025-01-09 09:00:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:19,928 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2025-01-09 09:00:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2025-01-09 09:00:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:19,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:19,930 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:00:19,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 373818774, now seen corresponding path program 1 times [2025-01-09 09:00:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029202225] [2025-01-09 09:00:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:19,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029202225] [2025-01-09 09:00:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029202225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:27,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:00:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738978383] [2025-01-09 09:00:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:00:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:27,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:00:27,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:00:27,092 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:30,040 INFO L93 Difference]: Finished difference Result 844 states and 1195 transitions. [2025-01-09 09:00:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 09:00:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:30,044 INFO L225 Difference]: With dead ends: 844 [2025-01-09 09:00:30,044 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 09:00:30,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-01-09 09:00:30,045 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 601 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:30,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1016 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 09:00:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 09:00:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2025-01-09 09:00:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 251 states have internal predecessors, (327), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 09:00:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 519 transitions. [2025-01-09 09:00:30,085 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 519 transitions. Word has length 198 [2025-01-09 09:00:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:30,085 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 519 transitions. [2025-01-09 09:00:30,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 519 transitions. [2025-01-09 09:00:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:30,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:30,087 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:00:30,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -19208236, now seen corresponding path program 1 times [2025-01-09 09:00:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599401514] [2025-01-09 09:00:30,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:30,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:30,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:30,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:30,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599401514] [2025-01-09 09:00:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599401514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:00:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541838131] [2025-01-09 09:00:36,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:36,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:00:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:36,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:00:36,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:00:36,457 INFO L87 Difference]: Start difference. First operand 352 states and 519 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:37,310 INFO L93 Difference]: Finished difference Result 811 states and 1166 transitions. [2025-01-09 09:00:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:00:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:37,314 INFO L225 Difference]: With dead ends: 811 [2025-01-09 09:00:37,314 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 09:00:37,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:00:37,315 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 362 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:37,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 708 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:00:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 09:00:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 352. [2025-01-09 09:00:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 251 states have internal predecessors, (327), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 09:00:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 519 transitions. [2025-01-09 09:00:37,356 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 519 transitions. Word has length 198 [2025-01-09 09:00:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:37,356 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 519 transitions. [2025-01-09 09:00:37,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 519 transitions. [2025-01-09 09:00:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:37,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:37,358 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:37,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:00:37,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 631984212, now seen corresponding path program 1 times [2025-01-09 09:00:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301546966] [2025-01-09 09:00:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:37,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:37,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:37,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:37,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301546966] [2025-01-09 09:00:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301546966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:00:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051445850] [2025-01-09 09:00:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:37,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:00:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:37,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:00:37,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:00:37,508 INFO L87 Difference]: Start difference. First operand 352 states and 519 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:37,769 INFO L93 Difference]: Finished difference Result 711 states and 1049 transitions. [2025-01-09 09:00:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:00:37,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:37,772 INFO L225 Difference]: With dead ends: 711 [2025-01-09 09:00:37,772 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 09:00:37,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:00:37,773 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 286 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:37,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 438 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:00:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 09:00:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 355. [2025-01-09 09:00:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 250 states have (on average 1.332) internal successors, (333), 254 states have internal predecessors, (333), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 09:00:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2025-01-09 09:00:37,815 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 198 [2025-01-09 09:00:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:37,815 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2025-01-09 09:00:37,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2025-01-09 09:00:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:37,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:37,818 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:00:37,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -212987240, now seen corresponding path program 1 times [2025-01-09 09:00:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083425828] [2025-01-09 09:00:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:37,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:37,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:37,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:37,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083425828] [2025-01-09 09:00:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083425828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:00:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759026345] [2025-01-09 09:00:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:46,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:00:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:46,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:00:46,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:00:46,279 INFO L87 Difference]: Start difference. First operand 355 states and 525 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:46,976 INFO L93 Difference]: Finished difference Result 885 states and 1286 transitions. [2025-01-09 09:00:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:00:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:46,979 INFO L225 Difference]: With dead ends: 885 [2025-01-09 09:00:46,979 INFO L226 Difference]: Without dead ends: 533 [2025-01-09 09:00:46,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:00:46,980 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 260 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:46,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 552 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:00:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-01-09 09:00:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 354. [2025-01-09 09:00:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 249 states have (on average 1.3293172690763053) internal successors, (331), 253 states have internal predecessors, (331), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 09:00:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 523 transitions. [2025-01-09 09:00:47,023 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 523 transitions. Word has length 198 [2025-01-09 09:00:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 523 transitions. [2025-01-09 09:00:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 523 transitions. [2025-01-09 09:00:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:47,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:47,026 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:47,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:00:47,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -637298476, now seen corresponding path program 1 times [2025-01-09 09:00:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458778920] [2025-01-09 09:00:47,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:47,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:47,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:47,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458778920] [2025-01-09 09:00:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458778920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:00:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890704158] [2025-01-09 09:00:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:00:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:47,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:00:47,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:00:47,130 INFO L87 Difference]: Start difference. First operand 354 states and 523 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:47,220 INFO L93 Difference]: Finished difference Result 693 states and 1019 transitions. [2025-01-09 09:00:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:00:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:47,222 INFO L225 Difference]: With dead ends: 693 [2025-01-09 09:00:47,222 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 09:00:47,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:00:47,224 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 75 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:47,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:00:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 09:00:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 334. [2025-01-09 09:00:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 237 states have internal predecessors, (306), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:00:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 486 transitions. [2025-01-09 09:00:47,260 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 486 transitions. Word has length 198 [2025-01-09 09:00:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:47,260 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 486 transitions. [2025-01-09 09:00:47,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 486 transitions. [2025-01-09 09:00:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:47,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:47,261 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:47,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:00:47,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:47,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash -379133038, now seen corresponding path program 1 times [2025-01-09 09:00:47,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:47,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751089996] [2025-01-09 09:00:47,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:47,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:47,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:47,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:47,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751089996] [2025-01-09 09:00:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751089996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:00:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747624370] [2025-01-09 09:00:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:51,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:00:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:51,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:00:51,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:00:51,506 INFO L87 Difference]: Start difference. First operand 334 states and 486 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:51,921 INFO L93 Difference]: Finished difference Result 735 states and 1061 transitions. [2025-01-09 09:00:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:00:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:51,923 INFO L225 Difference]: With dead ends: 735 [2025-01-09 09:00:51,923 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 09:00:51,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:00:51,924 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 132 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:51,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 470 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:00:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 09:00:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2025-01-09 09:00:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 246 states have (on average 1.3130081300813008) internal successors, (323), 249 states have internal predecessors, (323), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:00:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 503 transitions. [2025-01-09 09:00:51,957 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 503 transitions. Word has length 198 [2025-01-09 09:00:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:51,957 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 503 transitions. [2025-01-09 09:00:51,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 503 transitions. [2025-01-09 09:00:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 09:00:51,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:51,958 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:51,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:00:51,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:51,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash -965939052, now seen corresponding path program 1 times [2025-01-09 09:00:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041024098] [2025-01-09 09:00:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 09:00:51,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 09:00:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:00:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:00:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:00:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041024098] [2025-01-09 09:00:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041024098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:00:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:00:56,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:00:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98370049] [2025-01-09 09:00:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:00:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:00:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:00:56,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:00:56,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:00:56,047 INFO L87 Difference]: Start difference. First operand 346 states and 503 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:00:56,533 INFO L93 Difference]: Finished difference Result 772 states and 1107 transitions. [2025-01-09 09:00:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:00:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 09:00:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:00:56,536 INFO L225 Difference]: With dead ends: 772 [2025-01-09 09:00:56,536 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 09:00:56,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:00:56,537 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 164 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:00:56,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 678 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:00:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 09:00:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 351. [2025-01-09 09:00:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 251 states have (on average 1.3187250996015936) internal successors, (331), 254 states have internal predecessors, (331), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:00:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 511 transitions. [2025-01-09 09:00:56,569 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 511 transitions. Word has length 198 [2025-01-09 09:00:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:00:56,569 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 511 transitions. [2025-01-09 09:00:56,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:00:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 511 transitions. [2025-01-09 09:00:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:00:56,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:00:56,571 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:00:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:00:56,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:00:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:00:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 201466192, now seen corresponding path program 1 times [2025-01-09 09:00:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:00:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267805882] [2025-01-09 09:00:56,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:00:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:00:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:00:56,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:00:56,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:00:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267805882] [2025-01-09 09:01:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267805882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:00,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:00,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:01:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739555618] [2025-01-09 09:01:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:01:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:00,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:01:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:01:00,629 INFO L87 Difference]: Start difference. First operand 351 states and 511 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:01:02,060 INFO L93 Difference]: Finished difference Result 895 states and 1277 transitions. [2025-01-09 09:01:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 09:01:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2025-01-09 09:01:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:01:02,065 INFO L225 Difference]: With dead ends: 895 [2025-01-09 09:01:02,065 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 09:01:02,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:01:02,066 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 346 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:01:02,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 571 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:01:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 09:01:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 354. [2025-01-09 09:01:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 254 states have (on average 1.3267716535433072) internal successors, (337), 257 states have internal predecessors, (337), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:01:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 517 transitions. [2025-01-09 09:01:02,104 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 517 transitions. Word has length 199 [2025-01-09 09:01:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:01:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 517 transitions. [2025-01-09 09:01:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 517 transitions. [2025-01-09 09:01:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:01:02,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:01:02,106 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:01:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:01:02,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:01:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:01:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 424006804, now seen corresponding path program 1 times [2025-01-09 09:01:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:01:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040433816] [2025-01-09 09:01:02,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:01:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:01:02,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:01:02,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:01:02,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:01:02,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040433816] [2025-01-09 09:01:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040433816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:01:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861113072] [2025-01-09 09:01:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:01:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:01:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:01:04,568 INFO L87 Difference]: Start difference. First operand 354 states and 517 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:01:05,127 INFO L93 Difference]: Finished difference Result 849 states and 1221 transitions. [2025-01-09 09:01:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:01:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2025-01-09 09:01:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:01:05,129 INFO L225 Difference]: With dead ends: 849 [2025-01-09 09:01:05,130 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 09:01:05,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:01:05,131 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 205 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:01:05,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 574 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:01:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 09:01:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 365. [2025-01-09 09:01:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 265 states have (on average 1.3283018867924528) internal successors, (352), 268 states have internal predecessors, (352), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:01:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2025-01-09 09:01:05,165 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 199 [2025-01-09 09:01:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:01:05,165 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2025-01-09 09:01:05,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2025-01-09 09:01:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:01:05,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:01:05,166 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:01:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 09:01:05,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:01:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:01:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash -809651058, now seen corresponding path program 1 times [2025-01-09 09:01:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:01:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762946665] [2025-01-09 09:01:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:01:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:01:05,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:01:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:01:05,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:01:05,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762946665] [2025-01-09 09:01:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762946665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:08,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:08,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:01:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820532753] [2025-01-09 09:01:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:01:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:08,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:01:08,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:01:08,762 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:01:11,044 INFO L93 Difference]: Finished difference Result 794 states and 1147 transitions. [2025-01-09 09:01:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 09:01:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2025-01-09 09:01:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:01:11,049 INFO L225 Difference]: With dead ends: 794 [2025-01-09 09:01:11,050 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 09:01:11,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:01:11,051 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 201 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:01:11,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 601 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:01:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 09:01:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 333. [2025-01-09 09:01:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 233 states have (on average 1.3047210300429184) internal successors, (304), 236 states have internal predecessors, (304), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:01:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 484 transitions. [2025-01-09 09:01:11,103 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 484 transitions. Word has length 199 [2025-01-09 09:01:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:01:11,103 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 484 transitions. [2025-01-09 09:01:11,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 484 transitions. [2025-01-09 09:01:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:01:11,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:01:11,105 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:01:11,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 09:01:11,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:01:11,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:01:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -587110446, now seen corresponding path program 1 times [2025-01-09 09:01:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:01:11,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007550169] [2025-01-09 09:01:11,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:01:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:01:11,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:01:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:01:11,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:01:11,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007550169] [2025-01-09 09:01:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007550169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:01:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929724111] [2025-01-09 09:01:14,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:01:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:14,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:01:14,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:01:14,734 INFO L87 Difference]: Start difference. First operand 333 states and 484 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-01-09 09:01:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:01:17,195 INFO L93 Difference]: Finished difference Result 939 states and 1364 transitions. [2025-01-09 09:01:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:01:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 199 [2025-01-09 09:01:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:01:17,199 INFO L225 Difference]: With dead ends: 939 [2025-01-09 09:01:17,199 INFO L226 Difference]: Without dead ends: 609 [2025-01-09 09:01:17,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:01:17,200 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 330 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:01:17,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 568 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:01:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-09 09:01:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 548. [2025-01-09 09:01:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 381 states have internal predecessors, (497), 154 states have call successors, (154), 15 states have call predecessors, (154), 15 states have return successors, (154), 151 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 09:01:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 805 transitions. [2025-01-09 09:01:17,290 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 805 transitions. Word has length 199 [2025-01-09 09:01:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:01:17,291 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 805 transitions. [2025-01-09 09:01:17,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-01-09 09:01:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 805 transitions. [2025-01-09 09:01:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:01:17,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:01:17,292 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:01:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 09:01:17,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:01:17,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:01:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 113954132, now seen corresponding path program 1 times [2025-01-09 09:01:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:01:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25851204] [2025-01-09 09:01:17,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:01:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:01:17,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:01:17,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:01:17,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:01:17,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:19,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:19,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25851204] [2025-01-09 09:01:19,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25851204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:19,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:01:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670482843] [2025-01-09 09:01:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:19,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:01:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:19,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:01:19,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:01:19,023 INFO L87 Difference]: Start difference. First operand 548 states and 805 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:01:19,448 INFO L93 Difference]: Finished difference Result 1167 states and 1706 transitions. [2025-01-09 09:01:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:01:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2025-01-09 09:01:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:01:19,453 INFO L225 Difference]: With dead ends: 1167 [2025-01-09 09:01:19,453 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 09:01:19,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:01:19,455 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 175 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:01:19,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 501 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:01:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 09:01:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2025-01-09 09:01:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 233 states have internal predecessors, (298), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 09:01:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 478 transitions. [2025-01-09 09:01:19,494 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 478 transitions. Word has length 199 [2025-01-09 09:01:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:01:19,495 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 478 transitions. [2025-01-09 09:01:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:01:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 478 transitions. [2025-01-09 09:01:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 09:01:19,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:01:19,496 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:01:19,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 09:01:19,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:01:19,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:01:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -855856874, now seen corresponding path program 1 times [2025-01-09 09:01:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:01:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998871] [2025-01-09 09:01:19,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:01:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:01:19,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 09:01:19,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 09:01:19,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:01:19,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:01:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:01:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:01:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998871] [2025-01-09 09:01:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:01:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:01:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:01:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430236866] [2025-01-09 09:01:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:01:19,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:01:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:01:19,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:01:19,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:01:19,644 INFO L87 Difference]: Start difference. First operand 330 states and 478 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)