./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 05:52:41,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:52:41,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:52:41,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:52:41,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:52:41,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:52:41,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:52:41,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:52:41,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:52:41,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:52:41,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:52:41,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:52:41,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:52:41,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:52:41,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:52:41,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:52:41,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:52:41,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:52:41,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:52:41,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:52:41,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:52:41,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:41,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:52:41,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:52:41,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:52:41,591 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-08 05:52:41,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:52:41,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:52:41,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:52:41,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:52:41,835 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:52:41,836 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-08 05:52:42,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed80247a3/7d295c6425c840d5ab624faf77ee8332/FLAG3ccfffab5 [2025-03-08 05:52:43,134 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:52:43,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2025-03-08 05:52:43,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed80247a3/7d295c6425c840d5ab624faf77ee8332/FLAG3ccfffab5 [2025-03-08 05:52:43,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed80247a3/7d295c6425c840d5ab624faf77ee8332 [2025-03-08 05:52:43,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:52:43,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:52:43,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:43,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:52:43,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:52:43,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a36a757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43, skipping insertion in model container [2025-03-08 05:52:43,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:52:43,283 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-08 05:52:43,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:43,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:52:43,343 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-08 05:52:43,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:43,370 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:52:43,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43 WrapperNode [2025-03-08 05:52:43,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:43,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:43,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:52:43,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:52:43,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,395 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 297 [2025-03-08 05:52:43,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:43,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:52:43,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:52:43,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:52:43,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,411 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-08 05:52:43,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:52:43,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:52:43,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:52:43,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:52:43,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (1/1) ... [2025-03-08 05:52:43,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:43,445 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-08 05:52:43,447 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-08 05:52:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:52:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:52:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:52:43,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:52:43,522 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:52:43,887 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-08 05:52:43,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:52:43,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:52:43,896 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:52:43,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:43 BoogieIcfgContainer [2025-03-08 05:52:43,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:52:43,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:52:43,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:52:43,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:52:43,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:52:43" (1/3) ... [2025-03-08 05:52:43,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6044587f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:43, skipping insertion in model container [2025-03-08 05:52:43,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:43" (2/3) ... [2025-03-08 05:52:43,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6044587f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:43, skipping insertion in model container [2025-03-08 05:52:43,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:43" (3/3) ... [2025-03-08 05:52:43,905 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2025-03-08 05:52:43,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:52:43,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu2.cil.c that has 8 procedures, 132 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 05:52:43,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:52:43,971 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;@d9c1a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:52:43,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:52:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 109 states have internal predecessors, (155), 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-08 05:52:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:43,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:43,983 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] [2025-03-08 05:52:43,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:43,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2141514643, now seen corresponding path program 1 times [2025-03-08 05:52:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444570334] [2025-03-08 05:52:43,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:44,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:44,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,230 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-08 05:52:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444570334] [2025-03-08 05:52:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444570334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:44,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:44,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321464385] [2025-03-08 05:52:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:44,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:44,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:44,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:44,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:44,252 INFO L87 Difference]: Start difference. First operand has 132 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 109 states have internal predecessors, (155), 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 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-08 05:52:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:44,442 INFO L93 Difference]: Finished difference Result 365 states and 540 transitions. [2025-03-08 05:52:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 57 [2025-03-08 05:52:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:44,451 INFO L225 Difference]: With dead ends: 365 [2025-03-08 05:52:44,451 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 05:52:44,454 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-08 05:52:44,456 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 308 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 604 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-08 05:52:44,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 604 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 05:52:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2025-03-08 05:52:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 188 states have (on average 1.4361702127659575) internal successors, (270), 192 states have internal predecessors, (270), 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-08 05:52:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2025-03-08 05:52:44,500 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 57 [2025-03-08 05:52:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:44,501 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2025-03-08 05:52:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-08 05:52:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2025-03-08 05:52:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:44,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:44,505 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] [2025-03-08 05:52:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:52:44,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1577661654, now seen corresponding path program 1 times [2025-03-08 05:52:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574863147] [2025-03-08 05:52:44,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,624 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-08 05:52:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574863147] [2025-03-08 05:52:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574863147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:44,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79290537] [2025-03-08 05:52:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:44,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:44,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:44,626 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:44,672 INFO L93 Difference]: Finished difference Result 452 states and 644 transitions. [2025-03-08 05:52:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 57 [2025-03-08 05:52:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:44,676 INFO L225 Difference]: With dead ends: 452 [2025-03-08 05:52:44,676 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 05:52:44,677 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-08 05:52:44,678 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 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-08 05:52:44,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 05:52:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-03-08 05:52:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 191 states have (on average 1.4240837696335078) internal successors, (272), 195 states have internal predecessors, (272), 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-08 05:52:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2025-03-08 05:52:44,701 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 57 [2025-03-08 05:52:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2025-03-08 05:52:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2025-03-08 05:52:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:44,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:44,702 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] [2025-03-08 05:52:44,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:52:44,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1907427415, now seen corresponding path program 1 times [2025-03-08 05:52:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:44,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335402065] [2025-03-08 05:52:44,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:44,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:44,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,784 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-08 05:52:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335402065] [2025-03-08 05:52:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335402065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:44,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:44,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:44,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707471198] [2025-03-08 05:52:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:44,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:44,785 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,064 INFO L93 Difference]: Finished difference Result 782 states and 1094 transitions. [2025-03-08 05:52:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 57 [2025-03-08 05:52:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,067 INFO L225 Difference]: With dead ends: 782 [2025-03-08 05:52:45,067 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 05:52:45,069 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-08 05:52:45,070 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 548 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 981 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 05:52:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 523. [2025-03-08 05:52:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 438 states have (on average 1.4269406392694064) internal successors, (625), 443 states have internal predecessors, (625), 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-08 05:52:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 737 transitions. [2025-03-08 05:52:45,105 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 737 transitions. Word has length 57 [2025-03-08 05:52:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 737 transitions. [2025-03-08 05:52:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 737 transitions. [2025-03-08 05:52:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:45,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,110 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] [2025-03-08 05:52:45,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:52:45,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1581924314, now seen corresponding path program 1 times [2025-03-08 05:52:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638077358] [2025-03-08 05:52:45,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:45,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,182 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-08 05:52:45,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638077358] [2025-03-08 05:52:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638077358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718260823] [2025-03-08 05:52:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:45,184 INFO L87 Difference]: Start difference. First operand 523 states and 737 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,226 INFO L93 Difference]: Finished difference Result 1044 states and 1485 transitions. [2025-03-08 05:52:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 57 [2025-03-08 05:52:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,231 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:52:45,232 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 05:52:45,233 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-08 05:52:45,233 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 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-08 05:52:45,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 05:52:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-08 05:52:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 447 states have (on average 1.4138702460850112) internal successors, (632), 452 states have internal predecessors, (632), 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-08 05:52:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 744 transitions. [2025-03-08 05:52:45,266 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 744 transitions. Word has length 57 [2025-03-08 05:52:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,267 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 744 transitions. [2025-03-08 05:52:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 744 transitions. [2025-03-08 05:52:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:45,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,270 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] [2025-03-08 05:52:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:52:45,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1932724251, now seen corresponding path program 1 times [2025-03-08 05:52:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510567699] [2025-03-08 05:52:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:45,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:45,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,333 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-08 05:52:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510567699] [2025-03-08 05:52:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510567699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407963307] [2025-03-08 05:52:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:45,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:45,335 INFO L87 Difference]: Start difference. First operand 532 states and 744 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,630 INFO L93 Difference]: Finished difference Result 2203 states and 3102 transitions. [2025-03-08 05:52:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 57 [2025-03-08 05:52:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,640 INFO L225 Difference]: With dead ends: 2203 [2025-03-08 05:52:45,640 INFO L226 Difference]: Without dead ends: 1622 [2025-03-08 05:52:45,642 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-08 05:52:45,643 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 674 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 861 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-08 05:52:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1120. [2025-03-08 05:52:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 944 states have (on average 1.4110169491525424) internal successors, (1332), 950 states have internal predecessors, (1332), 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-08 05:52:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1565 transitions. [2025-03-08 05:52:45,702 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1565 transitions. Word has length 57 [2025-03-08 05:52:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,702 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1565 transitions. [2025-03-08 05:52:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-08 05:52:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1565 transitions. [2025-03-08 05:52:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:52:45,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,703 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] [2025-03-08 05:52:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:52:45,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1726824198, now seen corresponding path program 1 times [2025-03-08 05:52:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244687400] [2025-03-08 05:52:45,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:52:45,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:52:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,754 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-08 05:52:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244687400] [2025-03-08 05:52:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244687400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721350061] [2025-03-08 05:52:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:45,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:45,755 INFO L87 Difference]: Start difference. First operand 1120 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 05:52:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,939 INFO L93 Difference]: Finished difference Result 3106 states and 4368 transitions. [2025-03-08 05:52:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 58 [2025-03-08 05:52:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,949 INFO L225 Difference]: With dead ends: 3106 [2025-03-08 05:52:45,949 INFO L226 Difference]: Without dead ends: 1997 [2025-03-08 05:52:45,953 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-08 05:52:45,954 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 299 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 780 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-08 05:52:45,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 780 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2025-03-08 05:52:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1542. [2025-03-08 05:52:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1286 states have (on average 1.359253499222395) internal successors, (1748), 1297 states have internal predecessors, (1748), 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-08 05:52:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2099 transitions. [2025-03-08 05:52:46,051 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2099 transitions. Word has length 58 [2025-03-08 05:52:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,052 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2099 transitions. [2025-03-08 05:52:46,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 05:52:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2099 transitions. [2025-03-08 05:52:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:52:46,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,054 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] [2025-03-08 05:52:46,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:52:46,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1365568311, now seen corresponding path program 1 times [2025-03-08 05:52:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694811589] [2025-03-08 05:52:46,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:52:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:52:46,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,101 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-08 05:52:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694811589] [2025-03-08 05:52:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694811589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287809775] [2025-03-08 05:52:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:46,103 INFO L87 Difference]: Start difference. First operand 1542 states and 2099 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 05:52:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,165 INFO L93 Difference]: Finished difference Result 3103 states and 4285 transitions. [2025-03-08 05:52:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:46,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 58 [2025-03-08 05:52:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,175 INFO L225 Difference]: With dead ends: 3103 [2025-03-08 05:52:46,176 INFO L226 Difference]: Without dead ends: 1572 [2025-03-08 05:52:46,179 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-08 05:52:46,180 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 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-08 05:52:46,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-08 05:52:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-08 05:52:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1316 states have (on average 1.3465045592705167) internal successors, (1772), 1327 states have internal predecessors, (1772), 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-08 05:52:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2123 transitions. [2025-03-08 05:52:46,266 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2123 transitions. Word has length 58 [2025-03-08 05:52:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,266 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2123 transitions. [2025-03-08 05:52:46,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 05:52:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2123 transitions. [2025-03-08 05:52:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:52:46,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,267 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] [2025-03-08 05:52:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:52:46,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 852189642, now seen corresponding path program 1 times [2025-03-08 05:52:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154457306] [2025-03-08 05:52:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:52:46,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:52:46,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,330 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-08 05:52:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154457306] [2025-03-08 05:52:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154457306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175003603] [2025-03-08 05:52:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:46,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:46,332 INFO L87 Difference]: Start difference. First operand 1572 states and 2123 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-08 05:52:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,482 INFO L93 Difference]: Finished difference Result 4326 states and 5821 transitions. [2025-03-08 05:52:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 58 [2025-03-08 05:52:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,495 INFO L225 Difference]: With dead ends: 4326 [2025-03-08 05:52:46,497 INFO L226 Difference]: Without dead ends: 2829 [2025-03-08 05:52:46,502 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-08 05:52:46,503 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 133 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:46,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 695 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2025-03-08 05:52:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2777. [2025-03-08 05:52:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2336 states have (on average 1.3326198630136987) internal successors, (3113), 2365 states have internal predecessors, (3113), 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-08 05:52:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3702 transitions. [2025-03-08 05:52:46,616 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3702 transitions. Word has length 58 [2025-03-08 05:52:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,617 INFO L471 AbstractCegarLoop]: Abstraction has 2777 states and 3702 transitions. [2025-03-08 05:52:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-08 05:52:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3702 transitions. [2025-03-08 05:52:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:52:46,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,618 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] [2025-03-08 05:52:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:52:46,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -975711330, now seen corresponding path program 1 times [2025-03-08 05:52:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082635030] [2025-03-08 05:52:46,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:52:46,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:52:46,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,730 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-08 05:52:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082635030] [2025-03-08 05:52:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082635030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:52:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689935511] [2025-03-08 05:52:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:46,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:46,732 INFO L87 Difference]: Start difference. First operand 2777 states and 3702 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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-08 05:52:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,983 INFO L93 Difference]: Finished difference Result 6285 states and 8398 transitions. [2025-03-08 05:52:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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 69 [2025-03-08 05:52:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,002 INFO L225 Difference]: With dead ends: 6285 [2025-03-08 05:52:47,002 INFO L226 Difference]: Without dead ends: 4200 [2025-03-08 05:52:47,029 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-08 05:52:47,031 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 282 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1233 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2025-03-08 05:52:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 4174. [2025-03-08 05:52:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 3532 states have (on average 1.32559456398641) internal successors, (4682), 3569 states have internal predecessors, (4682), 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-08 05:52:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5534 transitions. [2025-03-08 05:52:47,182 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5534 transitions. Word has length 69 [2025-03-08 05:52:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,183 INFO L471 AbstractCegarLoop]: Abstraction has 4174 states and 5534 transitions. [2025-03-08 05:52:47,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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-08 05:52:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5534 transitions. [2025-03-08 05:52:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:52:47,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,184 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] [2025-03-08 05:52:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:52:47,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1660957366, now seen corresponding path program 1 times [2025-03-08 05:52:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230279555] [2025-03-08 05:52:47,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:47,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:52:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:52:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,247 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-08 05:52:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230279555] [2025-03-08 05:52:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230279555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:47,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605501202] [2025-03-08 05:52:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:47,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:47,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:47,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:47,248 INFO L87 Difference]: Start difference. First operand 4174 states and 5534 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:52:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:47,615 INFO L93 Difference]: Finished difference Result 12226 states and 16346 transitions. [2025-03-08 05:52:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:47,615 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), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-03-08 05:52:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,648 INFO L225 Difference]: With dead ends: 12226 [2025-03-08 05:52:47,648 INFO L226 Difference]: Without dead ends: 8064 [2025-03-08 05:52:47,659 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-08 05:52:47,659 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 192 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 500 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2025-03-08 05:52:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7903. [2025-03-08 05:52:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7903 states, 6713 states have (on average 1.29718456725756) internal successors, (8708), 6775 states have internal predecessors, (8708), 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-08 05:52:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7903 states to 7903 states and 10447 transitions. [2025-03-08 05:52:47,968 INFO L78 Accepts]: Start accepts. Automaton has 7903 states and 10447 transitions. Word has length 72 [2025-03-08 05:52:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,969 INFO L471 AbstractCegarLoop]: Abstraction has 7903 states and 10447 transitions. [2025-03-08 05:52:47,969 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:52:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7903 states and 10447 transitions. [2025-03-08 05:52:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:52:47,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:52:47,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash 459329833, now seen corresponding path program 1 times [2025-03-08 05:52:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876215667] [2025-03-08 05:52:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:52:47,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:52:47,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,993 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-08 05:52:47,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:47,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876215667] [2025-03-08 05:52:47,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876215667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:47,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:47,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758927302] [2025-03-08 05:52:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:47,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:47,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:47,995 INFO L87 Difference]: Start difference. First operand 7903 states and 10447 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 05:52:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,248 INFO L93 Difference]: Finished difference Result 15789 states and 20866 transitions. [2025-03-08 05:52:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 72 [2025-03-08 05:52:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,287 INFO L225 Difference]: With dead ends: 15789 [2025-03-08 05:52:48,288 INFO L226 Difference]: Without dead ends: 7898 [2025-03-08 05:52:48,307 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-08 05:52:48,308 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 176 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-08 05:52:48,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7898 states. [2025-03-08 05:52:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7898 to 7898. [2025-03-08 05:52:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 6711 states have (on average 1.2969751154820444) internal successors, (8704), 6772 states have internal predecessors, (8704), 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-08 05:52:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 10437 transitions. [2025-03-08 05:52:48,722 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 10437 transitions. Word has length 72 [2025-03-08 05:52:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 7898 states and 10437 transitions. [2025-03-08 05:52:48,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 05:52:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 10437 transitions. [2025-03-08 05:52:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:52:48,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:48,724 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] [2025-03-08 05:52:48,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:52:48,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1688008565, now seen corresponding path program 1 times [2025-03-08 05:52:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742014064] [2025-03-08 05:52:48,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:52:48,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:52:48,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,810 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-08 05:52:48,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742014064] [2025-03-08 05:52:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742014064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054479494] [2025-03-08 05:52:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:48,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:48,814 INFO L87 Difference]: Start difference. First operand 7898 states and 10437 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-08 05:52:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,100 INFO L93 Difference]: Finished difference Result 14111 states and 18655 transitions. [2025-03-08 05:52:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 73 [2025-03-08 05:52:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:49,133 INFO L225 Difference]: With dead ends: 14111 [2025-03-08 05:52:49,133 INFO L226 Difference]: Without dead ends: 7919 [2025-03-08 05:52:49,150 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-08 05:52:49,151 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 271 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 898 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-08 05:52:49,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 898 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7919 states. [2025-03-08 05:52:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7919 to 7890. [2025-03-08 05:52:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7890 states, 6703 states have (on average 1.2949425630314784) internal successors, (8680), 6764 states have internal predecessors, (8680), 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-08 05:52:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7890 states to 7890 states and 10413 transitions. [2025-03-08 05:52:49,452 INFO L78 Accepts]: Start accepts. Automaton has 7890 states and 10413 transitions. Word has length 73 [2025-03-08 05:52:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 7890 states and 10413 transitions. [2025-03-08 05:52:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-08 05:52:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7890 states and 10413 transitions. [2025-03-08 05:52:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:52:49,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,456 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:52:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:52:49,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -819133518, now seen corresponding path program 1 times [2025-03-08 05:52:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781777784] [2025-03-08 05:52:49,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:49,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:52:49,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:49,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:52:49,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:49,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781777784] [2025-03-08 05:52:49,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781777784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:49,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393524291] [2025-03-08 05:52:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:49,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:49,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:49,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:49,499 INFO L87 Difference]: Start difference. First operand 7890 states and 10413 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 05:52:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,970 INFO L93 Difference]: Finished difference Result 24341 states and 32549 transitions. [2025-03-08 05:52:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 76 [2025-03-08 05:52:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:50,035 INFO L225 Difference]: With dead ends: 24341 [2025-03-08 05:52:50,035 INFO L226 Difference]: Without dead ends: 16463 [2025-03-08 05:52:50,063 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-08 05:52:50,063 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 409 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-08 05:52:50,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 409 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-03-08 05:52:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16458. [2025-03-08 05:52:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16458 states, 14075 states have (on average 1.2712611012433392) internal successors, (17893), 14243 states have internal predecessors, (17893), 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-08 05:52:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16458 states to 16458 states and 21603 transitions. [2025-03-08 05:52:50,815 INFO L78 Accepts]: Start accepts. Automaton has 16458 states and 21603 transitions. Word has length 76 [2025-03-08 05:52:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:50,816 INFO L471 AbstractCegarLoop]: Abstraction has 16458 states and 21603 transitions. [2025-03-08 05:52:50,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 05:52:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16458 states and 21603 transitions. [2025-03-08 05:52:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:52:50,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:50,818 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] [2025-03-08 05:52:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:52:50,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:50,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 340655268, now seen corresponding path program 1 times [2025-03-08 05:52:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323507210] [2025-03-08 05:52:50,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:52:50,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:52:50,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:52:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323507210] [2025-03-08 05:52:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323507210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660918993] [2025-03-08 05:52:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:50,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:50,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:50,863 INFO L87 Difference]: Start difference. First operand 16458 states and 21603 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-08 05:52:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:51,612 INFO L93 Difference]: Finished difference Result 41794 states and 55474 transitions. [2025-03-08 05:52:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:52:51,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 78 [2025-03-08 05:52:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:51,693 INFO L225 Difference]: With dead ends: 41794 [2025-03-08 05:52:51,693 INFO L226 Difference]: Without dead ends: 25354 [2025-03-08 05:52:51,719 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-08 05:52:51,720 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 834 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:51,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 795 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25354 states. [2025-03-08 05:52:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25354 to 24753. [2025-03-08 05:52:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24753 states, 21051 states have (on average 1.2508194385064844) internal successors, (26331), 21311 states have internal predecessors, (26331), 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-08 05:52:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24753 states to 24753 states and 32242 transitions. [2025-03-08 05:52:52,531 INFO L78 Accepts]: Start accepts. Automaton has 24753 states and 32242 transitions. Word has length 78 [2025-03-08 05:52:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:52,532 INFO L471 AbstractCegarLoop]: Abstraction has 24753 states and 32242 transitions. [2025-03-08 05:52:52,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-08 05:52:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 24753 states and 32242 transitions. [2025-03-08 05:52:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:52:52,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:52,537 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] [2025-03-08 05:52:52,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:52:52,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -646643252, now seen corresponding path program 1 times [2025-03-08 05:52:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554344424] [2025-03-08 05:52:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:52,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:52:52,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:52:52,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:52,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:52,607 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-08 05:52:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554344424] [2025-03-08 05:52:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554344424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986084735] [2025-03-08 05:52:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:52,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:52,608 INFO L87 Difference]: Start difference. First operand 24753 states and 32242 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-08 05:52:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:53,663 INFO L93 Difference]: Finished difference Result 40736 states and 53203 transitions. [2025-03-08 05:52:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:53,663 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), 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 82 [2025-03-08 05:52:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:53,773 INFO L225 Difference]: With dead ends: 40736 [2025-03-08 05:52:53,773 INFO L226 Difference]: Without dead ends: 28372 [2025-03-08 05:52:53,811 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-08 05:52:53,812 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 420 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:53,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 983 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28372 states. [2025-03-08 05:52:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28372 to 28116. [2025-03-08 05:52:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28116 states, 23926 states have (on average 1.2515673326088774) internal successors, (29945), 24216 states have internal predecessors, (29945), 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-08 05:52:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28116 states to 28116 states and 36649 transitions. [2025-03-08 05:52:54,913 INFO L78 Accepts]: Start accepts. Automaton has 28116 states and 36649 transitions. Word has length 82 [2025-03-08 05:52:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:54,914 INFO L471 AbstractCegarLoop]: Abstraction has 28116 states and 36649 transitions. [2025-03-08 05:52:54,914 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), 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-08 05:52:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 28116 states and 36649 transitions. [2025-03-08 05:52:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:52:54,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:54,918 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] [2025-03-08 05:52:54,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:52:54,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:54,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1298250810, now seen corresponding path program 1 times [2025-03-08 05:52:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954870544] [2025-03-08 05:52:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:54,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:52:54,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:52:54,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:54,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:55,007 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-08 05:52:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954870544] [2025-03-08 05:52:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954870544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:55,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:52:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095306201] [2025-03-08 05:52:55,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:55,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:55,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:55,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:55,010 INFO L87 Difference]: Start difference. First operand 28116 states and 36649 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08 05:52:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:55,967 INFO L93 Difference]: Finished difference Result 56321 states and 73699 transitions. [2025-03-08 05:52:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:55,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 85 [2025-03-08 05:52:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:56,105 INFO L225 Difference]: With dead ends: 56321 [2025-03-08 05:52:56,105 INFO L226 Difference]: Without dead ends: 40527 [2025-03-08 05:52:56,142 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-08 05:52:56,144 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 423 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1639 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-08 05:52:56,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1639 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40527 states. [2025-03-08 05:52:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40527 to 39927. [2025-03-08 05:52:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39927 states, 34013 states have (on average 1.2532267074353924) internal successors, (42626), 34373 states have internal predecessors, (42626), 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-08 05:52:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39927 states to 39927 states and 52132 transitions. [2025-03-08 05:52:57,298 INFO L78 Accepts]: Start accepts. Automaton has 39927 states and 52132 transitions. Word has length 85 [2025-03-08 05:52:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:57,299 INFO L471 AbstractCegarLoop]: Abstraction has 39927 states and 52132 transitions. [2025-03-08 05:52:57,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08 05:52:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 39927 states and 52132 transitions. [2025-03-08 05:52:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:52:57,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:57,305 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:52:57,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:52:57,305 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1677494243, now seen corresponding path program 1 times [2025-03-08 05:52:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522080251] [2025-03-08 05:52:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:57,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:52:57,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:52:57,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:57,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:52:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522080251] [2025-03-08 05:52:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522080251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:57,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742470798] [2025-03-08 05:52:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:57,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:57,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:57,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:57,359 INFO L87 Difference]: Start difference. First operand 39927 states and 52132 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-08 05:52:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:58,920 INFO L93 Difference]: Finished difference Result 77344 states and 100598 transitions. [2025-03-08 05:52:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 93 [2025-03-08 05:52:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:59,071 INFO L225 Difference]: With dead ends: 77344 [2025-03-08 05:52:59,071 INFO L226 Difference]: Without dead ends: 40514 [2025-03-08 05:52:59,158 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-08 05:52:59,159 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 172 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 368 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-08 05:52:59,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 368 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40514 states. [2025-03-08 05:53:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40514 to 39136. [2025-03-08 05:53:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39136 states, 33141 states have (on average 1.243776590929664) internal successors, (41220), 33814 states have internal predecessors, (41220), 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-08 05:53:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39136 states to 39136 states and 50266 transitions. [2025-03-08 05:53:00,772 INFO L78 Accepts]: Start accepts. Automaton has 39136 states and 50266 transitions. Word has length 93 [2025-03-08 05:53:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 39136 states and 50266 transitions. [2025-03-08 05:53:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-08 05:53:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39136 states and 50266 transitions. [2025-03-08 05:53:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:53:00,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:00,778 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:53:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:53:00,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1466084738, now seen corresponding path program 1 times [2025-03-08 05:53:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386784459] [2025-03-08 05:53:00,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:00,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:53:00,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:53:00,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:00,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:53:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386784459] [2025-03-08 05:53:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386784459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:00,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:00,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526731899] [2025-03-08 05:53:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:00,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:00,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:00,827 INFO L87 Difference]: Start difference. First operand 39136 states and 50266 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-08 05:53:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:02,366 INFO L93 Difference]: Finished difference Result 79461 states and 101956 transitions. [2025-03-08 05:53:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:53:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 92 [2025-03-08 05:53:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:02,477 INFO L225 Difference]: With dead ends: 79461 [2025-03-08 05:53:02,477 INFO L226 Difference]: Without dead ends: 40351 [2025-03-08 05:53:02,525 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-08 05:53:02,526 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1084 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:02,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1171 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:53:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2025-03-08 05:53:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 39136. [2025-03-08 05:53:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39136 states, 33141 states have (on average 1.2312241634229504) internal successors, (40804), 33814 states have internal predecessors, (40804), 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-08 05:53:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39136 states to 39136 states and 49266 transitions. [2025-03-08 05:53:04,214 INFO L78 Accepts]: Start accepts. Automaton has 39136 states and 49266 transitions. Word has length 92 [2025-03-08 05:53:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 39136 states and 49266 transitions. [2025-03-08 05:53:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-08 05:53:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39136 states and 49266 transitions. [2025-03-08 05:53:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:53:04,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:04,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:53:04,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:53:04,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:04,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1229066490, now seen corresponding path program 1 times [2025-03-08 05:53:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817153327] [2025-03-08 05:53:04,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:04,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:53:04,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:53:04,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:04,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:53:04,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817153327] [2025-03-08 05:53:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817153327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:04,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:04,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:04,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144274772] [2025-03-08 05:53:04,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:04,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:04,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:04,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:04,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:04,296 INFO L87 Difference]: Start difference. First operand 39136 states and 49266 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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-08 05:53:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:05,848 INFO L93 Difference]: Finished difference Result 82071 states and 103418 transitions. [2025-03-08 05:53:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:53:05,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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 93 [2025-03-08 05:53:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:06,095 INFO L225 Difference]: With dead ends: 82071 [2025-03-08 05:53:06,095 INFO L226 Difference]: Without dead ends: 46297 [2025-03-08 05:53:06,135 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-08 05:53:06,136 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 142 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 833 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-08 05:53:06,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 833 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:53:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46297 states. [2025-03-08 05:53:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46297 to 46195. [2025-03-08 05:53:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46195 states, 39076 states have (on average 1.2280683795680214) internal successors, (47988), 39923 states have internal predecessors, (47988), 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-08 05:53:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46195 states to 46195 states and 57981 transitions. [2025-03-08 05:53:07,487 INFO L78 Accepts]: Start accepts. Automaton has 46195 states and 57981 transitions. Word has length 93 [2025-03-08 05:53:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 46195 states and 57981 transitions. [2025-03-08 05:53:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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-08 05:53:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 46195 states and 57981 transitions. [2025-03-08 05:53:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:53:07,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:07,493 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:53:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:53:07,493 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1353123648, now seen corresponding path program 1 times [2025-03-08 05:53:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856892814] [2025-03-08 05:53:07,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:07,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:53:07,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:53:07,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:53:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856892814] [2025-03-08 05:53:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856892814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:53:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879962875] [2025-03-08 05:53:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:53:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:07,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:53:07,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:53:07,521 INFO L87 Difference]: Start difference. First operand 46195 states and 57981 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-08 05:53:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:08,878 INFO L93 Difference]: Finished difference Result 48415 states and 60664 transitions. [2025-03-08 05:53:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:53:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 94 [2025-03-08 05:53:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:09,047 INFO L225 Difference]: With dead ends: 48415 [2025-03-08 05:53:09,047 INFO L226 Difference]: Without dead ends: 46187 [2025-03-08 05:53:09,074 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-08 05:53:09,074 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 175 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-08 05:53:09,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:53:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2025-03-08 05:53:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 45902. [2025-03-08 05:53:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45902 states, 38841 states have (on average 1.2283411858603022) internal successors, (47710), 39686 states have internal predecessors, (47710), 3871 states have call successors, (3871), 2392 states have call predecessors, (3871), 3189 states have return successors, (6043), 3825 states have call predecessors, (6043), 3868 states have call successors, (6043) [2025-03-08 05:53:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45902 states to 45902 states and 57624 transitions. [2025-03-08 05:53:10,757 INFO L78 Accepts]: Start accepts. Automaton has 45902 states and 57624 transitions. Word has length 94 [2025-03-08 05:53:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 45902 states and 57624 transitions. [2025-03-08 05:53:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-08 05:53:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45902 states and 57624 transitions. [2025-03-08 05:53:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:53:10,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:10,761 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 05:53:10,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:53:10,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1762594914, now seen corresponding path program 1 times [2025-03-08 05:53:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:10,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821317439] [2025-03-08 05:53:10,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:10,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:53:10,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:53:10,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:10,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:53:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821317439] [2025-03-08 05:53:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821317439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539927657] [2025-03-08 05:53:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:10,817 INFO L87 Difference]: Start difference. First operand 45902 states and 57624 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)