./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:42:39,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:42:39,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:42:39,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:42:39,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:42:39,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:42:39,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:42:39,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:42:39,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:42:39,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:42:39,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:42:39,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:42:39,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:42:39,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:42:39,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:42:39,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf [2025-03-03 14:42:39,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:42:39,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:42:39,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:42:39,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:42:39,562 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:42:39,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu2.cil.c [2025-03-03 14:42:40,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9094099b/3f891d2a7418416080c294e7e6342d31/FLAGca13e50f2 [2025-03-03 14:42:40,919 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:42:40,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2025-03-03 14:42:40,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9094099b/3f891d2a7418416080c294e7e6342d31/FLAGca13e50f2 [2025-03-03 14:42:41,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9094099b/3f891d2a7418416080c294e7e6342d31 [2025-03-03 14:42:41,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:42:41,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:42:41,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:42:41,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:42:41,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:42:41,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f2b7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41, skipping insertion in model container [2025-03-03 14:42:41,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:42:41,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2025-03-03 14:42:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:42:41,428 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:42:41,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2025-03-03 14:42:41,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:42:41,476 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:42:41,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41 WrapperNode [2025-03-03 14:42:41,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:42:41,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:42:41,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:42:41,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:42:41,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,504 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 297 [2025-03-03 14:42:41,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:42:41,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:42:41,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:42:41,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:42:41,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:42:41,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:42:41,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:42:41,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:42:41,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:42:41,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (1/1) ... [2025-03-03 14:42:41,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:42:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:41,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:42:41,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:42:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:42:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:42:41,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:42:41,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:42:41,880 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-03 14:42:41,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:42:41,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:42:41,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:42:41,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:42:41 BoogieIcfgContainer [2025-03-03 14:42:41,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:42:41,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:42:41,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:42:41,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:42:41,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:42:41" (1/3) ... [2025-03-03 14:42:41,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16283e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:42:41, skipping insertion in model container [2025-03-03 14:42:41,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:41" (2/3) ... [2025-03-03 14:42:41,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16283e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:42:41, skipping insertion in model container [2025-03-03 14:42:41,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:42:41" (3/3) ... [2025-03-03 14:42:41,895 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2025-03-03 14:42:41,904 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:42:41,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu2.cil.c that has 8 procedures, 140 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 14:42:41,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:42:41,961 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;@75d9943f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:42:41,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:42:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 117 states have internal predecessors, (163), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 14:42:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:42:41,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:41,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:41,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 840221144, now seen corresponding path program 1 times [2025-03-03 14:42:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834829332] [2025-03-03 14:42:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:42:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:42:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834829332] [2025-03-03 14:42:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834829332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:42,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:42,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:42:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889511276] [2025-03-03 14:42:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:42:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:42:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:42,208 INFO L87 Difference]: Start difference. First operand has 140 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 117 states have internal predecessors, (163), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:42,376 INFO L93 Difference]: Finished difference Result 387 states and 562 transitions. [2025-03-03 14:42:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:42:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-03 14:42:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:42,384 INFO L225 Difference]: With dead ends: 387 [2025-03-03 14:42:42,384 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 14:42:42,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:42,388 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 322 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:42,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 632 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 14:42:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2025-03-03 14:42:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 202 states have (on average 1.4059405940594059) internal successors, (284), 206 states have internal predecessors, (284), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 14:42:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 339 transitions. [2025-03-03 14:42:42,439 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 339 transitions. Word has length 59 [2025-03-03 14:42:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:42,440 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 339 transitions. [2025-03-03 14:42:42,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 339 transitions. [2025-03-03 14:42:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:42:42,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:42,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:42,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:42:42,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 143378011, now seen corresponding path program 1 times [2025-03-03 14:42:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335237125] [2025-03-03 14:42:42,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:42,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:42:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:42:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335237125] [2025-03-03 14:42:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335237125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568635420] [2025-03-03 14:42:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:42,557 INFO L87 Difference]: Start difference. First operand 244 states and 339 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:42,584 INFO L93 Difference]: Finished difference Result 480 states and 672 transitions. [2025-03-03 14:42:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:42,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-03 14:42:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:42,588 INFO L225 Difference]: With dead ends: 480 [2025-03-03 14:42:42,588 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 14:42:42,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:42,589 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:42,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 726 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 14:42:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-03 14:42:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 205 states have (on average 1.395121951219512) internal successors, (286), 209 states have internal predecessors, (286), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 14:42:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 341 transitions. [2025-03-03 14:42:42,610 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 341 transitions. Word has length 59 [2025-03-03 14:42:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:42,610 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 341 transitions. [2025-03-03 14:42:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 341 transitions. [2025-03-03 14:42:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:42:42,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:42,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:42,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:42:42,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -779305572, now seen corresponding path program 1 times [2025-03-03 14:42:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974980014] [2025-03-03 14:42:42,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:42,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:42:42,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:42:42,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974980014] [2025-03-03 14:42:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974980014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763166202] [2025-03-03 14:42:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:42,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:42,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:42,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:42,684 INFO L87 Difference]: Start difference. First operand 247 states and 341 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:42,948 INFO L93 Difference]: Finished difference Result 828 states and 1140 transitions. [2025-03-03 14:42:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:42,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-03 14:42:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:42,951 INFO L225 Difference]: With dead ends: 828 [2025-03-03 14:42:42,951 INFO L226 Difference]: Without dead ends: 576 [2025-03-03 14:42:42,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:42,952 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 580 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:42,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 951 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:42:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-03 14:42:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 555. [2025-03-03 14:42:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 470 states have (on average 1.397872340425532) internal successors, (657), 475 states have internal predecessors, (657), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-03-03 14:42:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 769 transitions. [2025-03-03 14:42:42,995 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 769 transitions. Word has length 59 [2025-03-03 14:42:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:42,996 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 769 transitions. [2025-03-03 14:42:42,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 769 transitions. [2025-03-03 14:42:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:42:42,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:42,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:42,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:42:42,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -55173025, now seen corresponding path program 1 times [2025-03-03 14:42:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808685112] [2025-03-03 14:42:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:42:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:42:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808685112] [2025-03-03 14:42:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808685112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367451294] [2025-03-03 14:42:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:43,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:43,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:43,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:43,078 INFO L87 Difference]: Start difference. First operand 555 states and 769 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:43,120 INFO L93 Difference]: Finished difference Result 1108 states and 1549 transitions. [2025-03-03 14:42:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-03 14:42:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:43,124 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 14:42:43,124 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 14:42:43,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:43,127 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:43,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 726 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 14:42:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-03 14:42:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 484 states have internal predecessors, (664), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-03-03 14:42:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 776 transitions. [2025-03-03 14:42:43,149 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 776 transitions. Word has length 59 [2025-03-03 14:42:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:43,150 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 776 transitions. [2025-03-03 14:42:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 776 transitions. [2025-03-03 14:42:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:42:43,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:43,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:42:43,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2056117344, now seen corresponding path program 1 times [2025-03-03 14:42:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38360796] [2025-03-03 14:42:43,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:43,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:42:43,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:42:43,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:43,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38360796] [2025-03-03 14:42:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38360796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749282940] [2025-03-03 14:42:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:43,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:43,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:43,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:43,216 INFO L87 Difference]: Start difference. First operand 564 states and 776 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:43,501 INFO L93 Difference]: Finished difference Result 2343 states and 3242 transitions. [2025-03-03 14:42:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:42:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-03 14:42:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:43,508 INFO L225 Difference]: With dead ends: 2343 [2025-03-03 14:42:43,508 INFO L226 Difference]: Without dead ends: 1730 [2025-03-03 14:42:43,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:43,511 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 722 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:43,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 879 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:42:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-03 14:42:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1195. [2025-03-03 14:42:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1019 states have (on average 1.3807654563297351) internal successors, (1407), 1025 states have internal predecessors, (1407), 112 states have call successors, (112), 60 states have call predecessors, (112), 63 states have return successors, (121), 110 states have call predecessors, (121), 109 states have call successors, (121) [2025-03-03 14:42:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1640 transitions. [2025-03-03 14:42:43,567 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1640 transitions. Word has length 59 [2025-03-03 14:42:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:43,567 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1640 transitions. [2025-03-03 14:42:43,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1640 transitions. [2025-03-03 14:42:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:42:43,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:43,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:43,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:42:43,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:43,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1138471853, now seen corresponding path program 1 times [2025-03-03 14:42:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449927419] [2025-03-03 14:42:43,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:42:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:42:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449927419] [2025-03-03 14:42:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449927419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:43,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:43,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:42:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213242238] [2025-03-03 14:42:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:43,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:42:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:43,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:42:43,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:43,621 INFO L87 Difference]: Start difference. First operand 1195 states and 1640 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:43,798 INFO L93 Difference]: Finished difference Result 3289 states and 4551 transitions. [2025-03-03 14:42:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:42:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-03-03 14:42:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:43,807 INFO L225 Difference]: With dead ends: 3289 [2025-03-03 14:42:43,807 INFO L226 Difference]: Without dead ends: 2105 [2025-03-03 14:42:43,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:43,810 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 313 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 815 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-03-03 14:42:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1628. [2025-03-03 14:42:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1372 states have (on average 1.336734693877551) internal successors, (1834), 1383 states have internal predecessors, (1834), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-03-03 14:42:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2185 transitions. [2025-03-03 14:42:43,911 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2185 transitions. Word has length 61 [2025-03-03 14:42:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2185 transitions. [2025-03-03 14:42:43,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2185 transitions. [2025-03-03 14:42:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:42:43,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:43,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:42:43,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:43,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 444791728, now seen corresponding path program 1 times [2025-03-03 14:42:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846962769] [2025-03-03 14:42:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:43,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:42:43,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:42:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846962769] [2025-03-03 14:42:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846962769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143592441] [2025-03-03 14:42:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:43,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:43,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:43,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:43,974 INFO L87 Difference]: Start difference. First operand 1628 states and 2185 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:44,058 INFO L93 Difference]: Finished difference Result 3275 states and 4457 transitions. [2025-03-03 14:42:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:44,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-03-03 14:42:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:44,067 INFO L225 Difference]: With dead ends: 3275 [2025-03-03 14:42:44,067 INFO L226 Difference]: Without dead ends: 1658 [2025-03-03 14:42:44,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:44,073 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:44,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-03-03 14:42:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2025-03-03 14:42:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1402 states have (on average 1.3252496433666192) internal successors, (1858), 1413 states have internal predecessors, (1858), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-03-03 14:42:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2209 transitions. [2025-03-03 14:42:44,155 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2209 transitions. Word has length 61 [2025-03-03 14:42:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:44,155 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2209 transitions. [2025-03-03 14:42:44,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:42:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2209 transitions. [2025-03-03 14:42:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:42:44,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:44,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:42:44,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 190055183, now seen corresponding path program 1 times [2025-03-03 14:42:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995132282] [2025-03-03 14:42:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:44,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:42:44,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:42:44,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:44,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995132282] [2025-03-03 14:42:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995132282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647704133] [2025-03-03 14:42:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:44,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:44,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:44,214 INFO L87 Difference]: Start difference. First operand 1658 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 14:42:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:44,358 INFO L93 Difference]: Finished difference Result 4564 states and 6059 transitions. [2025-03-03 14:42:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-03-03 14:42:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:44,371 INFO L225 Difference]: With dead ends: 4564 [2025-03-03 14:42:44,371 INFO L226 Difference]: Without dead ends: 2986 [2025-03-03 14:42:44,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:44,376 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 138 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:44,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 727 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2025-03-03 14:42:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2934. [2025-03-03 14:42:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2493 states have (on average 1.3116726835138388) internal successors, (3270), 2522 states have internal predecessors, (3270), 277 states have call successors, (277), 158 states have call predecessors, (277), 163 states have return successors, (312), 254 states have call predecessors, (312), 274 states have call successors, (312) [2025-03-03 14:42:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 3859 transitions. [2025-03-03 14:42:44,483 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 3859 transitions. Word has length 61 [2025-03-03 14:42:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:44,484 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 3859 transitions. [2025-03-03 14:42:44,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 14:42:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3859 transitions. [2025-03-03 14:42:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:42:44,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:44,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:42:44,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -535368337, now seen corresponding path program 1 times [2025-03-03 14:42:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858753358] [2025-03-03 14:42:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:42:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:42:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858753358] [2025-03-03 14:42:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858753358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:42:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807475750] [2025-03-03 14:42:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:44,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:42:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:42:44,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:42:44,570 INFO L87 Difference]: Start difference. First operand 2934 states and 3859 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:42:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:44,805 INFO L93 Difference]: Finished difference Result 6638 states and 8751 transitions. [2025-03-03 14:42:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:42:44,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-03 14:42:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:44,821 INFO L225 Difference]: With dead ends: 6638 [2025-03-03 14:42:44,821 INFO L226 Difference]: Without dead ends: 4433 [2025-03-03 14:42:44,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:44,825 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 294 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:44,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1244 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-03-03 14:42:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4407. [2025-03-03 14:42:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4407 states, 3765 states have (on average 1.3054448871181938) internal successors, (4915), 3802 states have internal predecessors, (4915), 401 states have call successors, (401), 231 states have call predecessors, (401), 240 states have return successors, (451), 374 states have call predecessors, (451), 398 states have call successors, (451) [2025-03-03 14:42:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 5767 transitions. [2025-03-03 14:42:44,953 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 5767 transitions. Word has length 73 [2025-03-03 14:42:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:44,953 INFO L471 AbstractCegarLoop]: Abstraction has 4407 states and 5767 transitions. [2025-03-03 14:42:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:42:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 5767 transitions. [2025-03-03 14:42:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:42:44,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:44,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:42:44,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 139662372, now seen corresponding path program 1 times [2025-03-03 14:42:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857975437] [2025-03-03 14:42:44,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:42:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857975437] [2025-03-03 14:42:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857975437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:45,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:45,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:42:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492909333] [2025-03-03 14:42:45,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:45,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:42:45,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:45,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:42:45,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:45,001 INFO L87 Difference]: Start difference. First operand 4407 states and 5767 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:42:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:45,302 INFO L93 Difference]: Finished difference Result 12852 states and 16972 transitions. [2025-03-03 14:42:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-03 14:42:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:45,336 INFO L225 Difference]: With dead ends: 12852 [2025-03-03 14:42:45,336 INFO L226 Difference]: Without dead ends: 8457 [2025-03-03 14:42:45,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:45,350 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 195 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:45,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 531 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8457 states. [2025-03-03 14:42:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8457 to 8296. [2025-03-03 14:42:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8296 states, 7106 states have (on average 1.2807486631016043) internal successors, (9101), 7168 states have internal predecessors, (9101), 716 states have call successors, (716), 428 states have call predecessors, (716), 473 states have return successors, (1023), 701 states have call predecessors, (1023), 713 states have call successors, (1023) [2025-03-03 14:42:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 10840 transitions. [2025-03-03 14:42:45,742 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 10840 transitions. Word has length 76 [2025-03-03 14:42:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:45,742 INFO L471 AbstractCegarLoop]: Abstraction has 8296 states and 10840 transitions. [2025-03-03 14:42:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:42:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 10840 transitions. [2025-03-03 14:42:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:42:45,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:45,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:45,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:42:45,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1530851197, now seen corresponding path program 1 times [2025-03-03 14:42:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172878975] [2025-03-03 14:42:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:45,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:42:45,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172878975] [2025-03-03 14:42:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172878975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:42:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279637972] [2025-03-03 14:42:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:45,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:42:45,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:45,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:42:45,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:42:45,767 INFO L87 Difference]: Start difference. First operand 8296 states and 10840 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:42:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:45,975 INFO L93 Difference]: Finished difference Result 16575 states and 21652 transitions. [2025-03-03 14:42:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:42:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-03 14:42:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:46,008 INFO L225 Difference]: With dead ends: 16575 [2025-03-03 14:42:46,009 INFO L226 Difference]: Without dead ends: 8291 [2025-03-03 14:42:46,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:42:46,028 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:46,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 184 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2025-03-03 14:42:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 8291. [2025-03-03 14:42:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8291 states, 7104 states have (on average 1.2805461711711712) internal successors, (9097), 7165 states have internal predecessors, (9097), 713 states have call successors, (713), 428 states have call predecessors, (713), 473 states have return successors, (1020), 698 states have call predecessors, (1020), 710 states have call successors, (1020) [2025-03-03 14:42:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 10830 transitions. [2025-03-03 14:42:46,328 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 10830 transitions. Word has length 76 [2025-03-03 14:42:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:46,329 INFO L471 AbstractCegarLoop]: Abstraction has 8291 states and 10830 transitions. [2025-03-03 14:42:46,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:42:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 10830 transitions. [2025-03-03 14:42:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:42:46,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:46,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:46,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:42:46,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:46,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash 955781529, now seen corresponding path program 1 times [2025-03-03 14:42:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101467706] [2025-03-03 14:42:46,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:46,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:42:46,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:42:46,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:46,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101467706] [2025-03-03 14:42:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101467706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793252388] [2025-03-03 14:42:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:46,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:46,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:46,411 INFO L87 Difference]: Start difference. First operand 8291 states and 10830 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:42:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:46,707 INFO L93 Difference]: Finished difference Result 14819 states and 19363 transitions. [2025-03-03 14:42:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2025-03-03 14:42:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:46,735 INFO L225 Difference]: With dead ends: 14819 [2025-03-03 14:42:46,735 INFO L226 Difference]: Without dead ends: 8312 [2025-03-03 14:42:46,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:42:46,748 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 283 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:46,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 937 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2025-03-03 14:42:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 8283. [2025-03-03 14:42:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 7096 states have (on average 1.278607666290868) internal successors, (9073), 7157 states have internal predecessors, (9073), 713 states have call successors, (713), 428 states have call predecessors, (713), 473 states have return successors, (1020), 698 states have call predecessors, (1020), 710 states have call successors, (1020) [2025-03-03 14:42:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 10806 transitions. [2025-03-03 14:42:47,042 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 10806 transitions. Word has length 77 [2025-03-03 14:42:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:47,042 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 10806 transitions. [2025-03-03 14:42:47,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:42:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 10806 transitions. [2025-03-03 14:42:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:42:47,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:47,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:47,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:42:47,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1401974601, now seen corresponding path program 1 times [2025-03-03 14:42:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971292949] [2025-03-03 14:42:47,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:47,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:42:47,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:42:47,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:47,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:42:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971292949] [2025-03-03 14:42:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971292949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:42:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453130766] [2025-03-03 14:42:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:42:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:42:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:47,093 INFO L87 Difference]: Start difference. First operand 8283 states and 10806 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:42:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:47,762 INFO L93 Difference]: Finished difference Result 25454 states and 33662 transitions. [2025-03-03 14:42:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2025-03-03 14:42:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:47,823 INFO L225 Difference]: With dead ends: 25454 [2025-03-03 14:42:47,823 INFO L226 Difference]: Without dead ends: 17183 [2025-03-03 14:42:47,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:47,849 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 212 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:47,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 435 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17183 states. [2025-03-03 14:42:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17183 to 17178. [2025-03-03 14:42:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17178 states, 14795 states have (on average 1.258060155457925) internal successors, (18613), 14963 states have internal predecessors, (18613), 1376 states have call successors, (1376), 841 states have call predecessors, (1376), 1006 states have return successors, (2334), 1375 states have call predecessors, (2334), 1373 states have call successors, (2334) [2025-03-03 14:42:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17178 states to 17178 states and 22323 transitions. [2025-03-03 14:42:48,369 INFO L78 Accepts]: Start accepts. Automaton has 17178 states and 22323 transitions. Word has length 80 [2025-03-03 14:42:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:48,370 INFO L471 AbstractCegarLoop]: Abstraction has 17178 states and 22323 transitions. [2025-03-03 14:42:48,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:42:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17178 states and 22323 transitions. [2025-03-03 14:42:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:42:48,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:48,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:48,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:42:48,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -102742407, now seen corresponding path program 1 times [2025-03-03 14:42:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99232899] [2025-03-03 14:42:48,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:48,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:42:48,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:42:48,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:48,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:42:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99232899] [2025-03-03 14:42:48,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99232899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:48,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440540474] [2025-03-03 14:42:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:48,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:48,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:48,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:48,419 INFO L87 Difference]: Start difference. First operand 17178 states and 22323 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:42:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:49,141 INFO L93 Difference]: Finished difference Result 43520 states and 57200 transitions. [2025-03-03 14:42:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:42:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2025-03-03 14:42:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:49,213 INFO L225 Difference]: With dead ends: 43520 [2025-03-03 14:42:49,213 INFO L226 Difference]: Without dead ends: 26360 [2025-03-03 14:42:49,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:49,235 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 766 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:49,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 847 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26360 states. [2025-03-03 14:42:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26360 to 25759. [2025-03-03 14:42:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25759 states, 22057 states have (on average 1.2393797887292015) internal successors, (27337), 22317 states have internal predecessors, (27337), 2133 states have call successors, (2133), 1310 states have call predecessors, (2133), 1568 states have return successors, (3778), 2135 states have call predecessors, (3778), 2130 states have call successors, (3778) [2025-03-03 14:42:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25759 states to 25759 states and 33248 transitions. [2025-03-03 14:42:50,134 INFO L78 Accepts]: Start accepts. Automaton has 25759 states and 33248 transitions. Word has length 82 [2025-03-03 14:42:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 25759 states and 33248 transitions. [2025-03-03 14:42:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:42:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25759 states and 33248 transitions. [2025-03-03 14:42:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:42:50,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:50,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:42:50,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 122735105, now seen corresponding path program 1 times [2025-03-03 14:42:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36438819] [2025-03-03 14:42:50,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:50,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:42:50,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:42:50,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:50,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:42:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36438819] [2025-03-03 14:42:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36438819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:42:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815755381] [2025-03-03 14:42:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:42:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:42:50,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:50,210 INFO L87 Difference]: Start difference. First operand 25759 states and 33248 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:42:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:51,300 INFO L93 Difference]: Finished difference Result 42402 states and 54869 transitions. [2025-03-03 14:42:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2025-03-03 14:42:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:51,396 INFO L225 Difference]: With dead ends: 42402 [2025-03-03 14:42:51,396 INFO L226 Difference]: Without dead ends: 29522 [2025-03-03 14:42:51,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:51,586 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 427 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:51,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1175 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:42:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29522 states. [2025-03-03 14:42:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29522 to 29258. [2025-03-03 14:42:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29258 states, 25068 states have (on average 1.240106909206957) internal successors, (31087), 25358 states have internal predecessors, (31087), 2417 states have call successors, (2417), 1486 states have call predecessors, (2417), 1772 states have return successors, (4287), 2417 states have call predecessors, (4287), 2414 states have call successors, (4287) [2025-03-03 14:42:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29258 states to 29258 states and 37791 transitions. [2025-03-03 14:42:52,287 INFO L78 Accepts]: Start accepts. Automaton has 29258 states and 37791 transitions. Word has length 87 [2025-03-03 14:42:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:52,287 INFO L471 AbstractCegarLoop]: Abstraction has 29258 states and 37791 transitions. [2025-03-03 14:42:52,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:42:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 29258 states and 37791 transitions. [2025-03-03 14:42:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:42:52,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:52,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:52,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:42:52,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1300219154, now seen corresponding path program 1 times [2025-03-03 14:42:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681356325] [2025-03-03 14:42:52,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:42:52,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:42:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:42:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681356325] [2025-03-03 14:42:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681356325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:52,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:42:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876197007] [2025-03-03 14:42:52,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:52,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:42:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:52,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:42:52,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:42:52,385 INFO L87 Difference]: Start difference. First operand 29258 states and 37791 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:42:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:53,446 INFO L93 Difference]: Finished difference Result 58655 states and 76033 transitions. [2025-03-03 14:42:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:42:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-03-03 14:42:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:53,584 INFO L225 Difference]: With dead ends: 58655 [2025-03-03 14:42:53,584 INFO L226 Difference]: Without dead ends: 42201 [2025-03-03 14:42:53,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:53,631 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 442 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:53,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1735 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:42:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42201 states. [2025-03-03 14:42:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42201 to 41585. [2025-03-03 14:42:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41585 states, 35671 states have (on average 1.2414566454542906) internal successors, (44284), 36031 states have internal predecessors, (44284), 3423 states have call successors, (3423), 2106 states have call predecessors, (3423), 2490 states have return successors, (6083), 3451 states have call predecessors, (6083), 3420 states have call successors, (6083) [2025-03-03 14:42:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41585 states to 41585 states and 53790 transitions. [2025-03-03 14:42:55,168 INFO L78 Accepts]: Start accepts. Automaton has 41585 states and 53790 transitions. Word has length 90 [2025-03-03 14:42:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:55,168 INFO L471 AbstractCegarLoop]: Abstraction has 41585 states and 53790 transitions. [2025-03-03 14:42:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:42:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 41585 states and 53790 transitions. [2025-03-03 14:42:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:42:55,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:55,175 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:42:55,176 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash 455995122, now seen corresponding path program 1 times [2025-03-03 14:42:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453305724] [2025-03-03 14:42:55,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:42:55,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:42:55,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:55,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:42:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453305724] [2025-03-03 14:42:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453305724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:42:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90433191] [2025-03-03 14:42:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:42:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:42:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:42:55,237 INFO L87 Difference]: Start difference. First operand 41585 states and 53790 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:42:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:56,938 INFO L93 Difference]: Finished difference Result 80534 states and 103788 transitions. [2025-03-03 14:42:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:42:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2025-03-03 14:42:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:57,111 INFO L225 Difference]: With dead ends: 80534 [2025-03-03 14:42:57,112 INFO L226 Difference]: Without dead ends: 42172 [2025-03-03 14:42:57,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:42:57,401 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 174 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:57,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 394 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42172 states. [2025-03-03 14:42:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42172 to 40694. [2025-03-03 14:42:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40694 states, 34699 states have (on average 1.232830917317502) internal successors, (42778), 35372 states have internal predecessors, (42778), 3299 states have call successors, (3299), 2026 states have call predecessors, (3299), 2695 states have return successors, (5747), 3299 states have call predecessors, (5747), 3296 states have call successors, (5747) [2025-03-03 14:42:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40694 states to 40694 states and 51824 transitions. [2025-03-03 14:42:58,595 INFO L78 Accepts]: Start accepts. Automaton has 40694 states and 51824 transitions. Word has length 99 [2025-03-03 14:42:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 40694 states and 51824 transitions. [2025-03-03 14:42:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:42:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 40694 states and 51824 transitions. [2025-03-03 14:42:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:42:58,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:58,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:58,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:42:58,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1308934818, now seen corresponding path program 1 times [2025-03-03 14:42:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299854965] [2025-03-03 14:42:58,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:58,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:42:58,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:42:58,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:42:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299854965] [2025-03-03 14:42:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299854965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:58,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:42:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981172837] [2025-03-03 14:42:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:58,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:42:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:58,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:42:58,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:42:58,662 INFO L87 Difference]: Start difference. First operand 40694 states and 51824 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:00,088 INFO L93 Difference]: Finished difference Result 82633 states and 105128 transitions. [2025-03-03 14:43:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:43:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 98 [2025-03-03 14:43:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:00,206 INFO L225 Difference]: With dead ends: 82633 [2025-03-03 14:43:00,206 INFO L226 Difference]: Without dead ends: 41965 [2025-03-03 14:43:00,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:00,269 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1311 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:00,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1198 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41965 states. [2025-03-03 14:43:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41965 to 40694. [2025-03-03 14:43:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40694 states, 34699 states have (on average 1.2208420991959423) internal successors, (42362), 35372 states have internal predecessors, (42362), 3299 states have call successors, (3299), 2026 states have call predecessors, (3299), 2695 states have return successors, (5163), 3299 states have call predecessors, (5163), 3296 states have call successors, (5163) [2025-03-03 14:43:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40694 states to 40694 states and 50824 transitions. [2025-03-03 14:43:02,329 INFO L78 Accepts]: Start accepts. Automaton has 40694 states and 50824 transitions. Word has length 98 [2025-03-03 14:43:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 40694 states and 50824 transitions. [2025-03-03 14:43:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 40694 states and 50824 transitions. [2025-03-03 14:43:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:43:02,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:02,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:43:02,334 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1934484994, now seen corresponding path program 1 times [2025-03-03 14:43:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458859651] [2025-03-03 14:43:02,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:43:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:43:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:43:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458859651] [2025-03-03 14:43:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458859651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133482029] [2025-03-03 14:43:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:02,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:02,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:02,388 INFO L87 Difference]: Start difference. First operand 40694 states and 50824 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:03,552 INFO L93 Difference]: Finished difference Result 85333 states and 106680 transitions. [2025-03-03 14:43:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:43:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2025-03-03 14:43:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:03,711 INFO L225 Difference]: With dead ends: 85333 [2025-03-03 14:43:03,711 INFO L226 Difference]: Without dead ends: 48139 [2025-03-03 14:43:03,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:43:03,783 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 148 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:03,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 885 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:43:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48139 states. [2025-03-03 14:43:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48139 to 48037. [2025-03-03 14:43:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48037 states, 40918 states have (on average 1.21780145657168) internal successors, (49830), 41765 states have internal predecessors, (49830), 3909 states have call successors, (3909), 2412 states have call predecessors, (3909), 3209 states have return successors, (6084), 3863 states have call predecessors, (6084), 3906 states have call successors, (6084) [2025-03-03 14:43:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48037 states to 48037 states and 59823 transitions. [2025-03-03 14:43:05,690 INFO L78 Accepts]: Start accepts. Automaton has 48037 states and 59823 transitions. Word has length 99 [2025-03-03 14:43:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 48037 states and 59823 transitions. [2025-03-03 14:43:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 48037 states and 59823 transitions. [2025-03-03 14:43:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:43:05,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:05,696 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:05,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:43:05,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:05,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash 268444587, now seen corresponding path program 1 times [2025-03-03 14:43:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:05,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296026035] [2025-03-03 14:43:05,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:05,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:05,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:43:05,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:43:05,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:43:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296026035] [2025-03-03 14:43:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296026035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:05,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:43:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941192736] [2025-03-03 14:43:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:05,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:05,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:05,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:05,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:43:05,726 INFO L87 Difference]: Start difference. First operand 48037 states and 59823 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:07,192 INFO L93 Difference]: Finished difference Result 50343 states and 62592 transitions. [2025-03-03 14:43:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2025-03-03 14:43:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:07,317 INFO L225 Difference]: With dead ends: 50343 [2025-03-03 14:43:07,318 INFO L226 Difference]: Without dead ends: 48029 [2025-03-03 14:43:07,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:43:07,337 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:07,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states.