./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/eca-rers2018/Problem10.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/eca-rers2018/Problem10.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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-23 00:01:50,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 00:01:50,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 00:01:50,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 00:01:50,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 00:01:50,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 00:01:50,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 00:01:50,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 00:01:50,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 00:01:50,769 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 00:01:50,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 00:01:50,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 00:01:50,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 00:01:50,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 00:01:50,771 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 00:01:50,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 00:01:50,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 00:01:50,774 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 00:01:50,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 00:01:50,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 00:01:50,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 00:01:50,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 00:01:50,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 00:01:50,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 00:01:50,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 00:01:50,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 00:01:50,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:01:50,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 00:01:50,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 00:01:50,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 00:01:50,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 00:01:50,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 00:01:50,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 00:01:50,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 00:01:50,779 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 00:01:50,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 00:01:50,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 00:01:50,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 00:01:51,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 00:01:51,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 00:01:51,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 00:01:51,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 00:01:51,092 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 00:01:51,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2018/Problem10.c [2023-11-23 00:01:52,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 00:01:52,423 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 00:01:52,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c [2023-11-23 00:01:52,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c889397b2/983184d7f7a04b2cab1cbc52f3a59f05/FLAG2f1ad68fd [2023-11-23 00:01:52,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c889397b2/983184d7f7a04b2cab1cbc52f3a59f05 [2023-11-23 00:01:52,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 00:01:52,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 00:01:52,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 00:01:52,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 00:01:52,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 00:01:52,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:52" (1/1) ... [2023-11-23 00:01:52,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ae5b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:52, skipping insertion in model container [2023-11-23 00:01:52,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:52" (1/1) ... [2023-11-23 00:01:52,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 00:01:52,587 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c[778,791] [2023-11-23 00:01:52,592 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c[817,830] [2023-11-23 00:01:52,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:01:52,938 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 00:01:52,961 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c[778,791] [2023-11-23 00:01:52,970 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c[817,830] [2023-11-23 00:01:53,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:01:53,118 INFO L206 MainTranslator]: Completed translation [2023-11-23 00:01:53,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53 WrapperNode [2023-11-23 00:01:53,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 00:01:53,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 00:01:53,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 00:01:53,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 00:01:53,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,205 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 866 [2023-11-23 00:01:53,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 00:01:53,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 00:01:53,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 00:01:53,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 00:01:53,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 00:01:53,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 00:01:53,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 00:01:53,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 00:01:53,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (1/1) ... [2023-11-23 00:01:53,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:01:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:01:53,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 00:01:53,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 00:01:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 00:01:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2023-11-23 00:01:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2023-11-23 00:01:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2023-11-23 00:01:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2023-11-23 00:01:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 00:01:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 00:01:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 00:01:53,488 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 00:01:53,490 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 00:01:54,304 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 00:01:54,338 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 00:01:54,339 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 00:01:54,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:54 BoogieIcfgContainer [2023-11-23 00:01:54,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 00:01:54,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 00:01:54,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 00:01:54,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 00:01:54,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:52" (1/3) ... [2023-11-23 00:01:54,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b034da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:54, skipping insertion in model container [2023-11-23 00:01:54,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:53" (2/3) ... [2023-11-23 00:01:54,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b034da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:54, skipping insertion in model container [2023-11-23 00:01:54,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:54" (3/3) ... [2023-11-23 00:01:54,347 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2023-11-23 00:01:54,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 00:01:54,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 00:01:54,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 00:01:54,439 INFO L357 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, mHoare=true, 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;@756458f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 00:01:54,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-23 00:01:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 358 states have (on average 1.600558659217877) internal successors, (573), 360 states have internal predecessors, (573), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-23 00:01:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 00:01:54,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:54,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:01:54,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:54,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -973882549, now seen corresponding path program 1 times [2023-11-23 00:01:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735460330] [2023-11-23 00:01:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:54,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735460330] [2023-11-23 00:01:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735460330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581422779] [2023-11-23 00:01:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:01:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:01:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:01:54,770 INFO L87 Difference]: Start difference. First operand has 463 states, 358 states have (on average 1.600558659217877) internal successors, (573), 360 states have internal predecessors, (573), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:55,601 INFO L93 Difference]: Finished difference Result 1154 states and 2058 transitions. [2023-11-23 00:01:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:01:55,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 00:01:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:55,616 INFO L225 Difference]: With dead ends: 1154 [2023-11-23 00:01:55,617 INFO L226 Difference]: Without dead ends: 686 [2023-11-23 00:01:55,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:01:55,624 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 570 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:55,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 639 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 00:01:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-11-23 00:01:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 554. [2023-11-23 00:01:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 452 states have (on average 1.592920353982301) internal successors, (720), 551 states have internal predecessors, (720), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 820 transitions. [2023-11-23 00:01:55,676 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 820 transitions. Word has length 12 [2023-11-23 00:01:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:55,677 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 820 transitions. [2023-11-23 00:01:55,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 820 transitions. [2023-11-23 00:01:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 00:01:55,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:55,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:01:55,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 00:01:55,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:55,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1176212298, now seen corresponding path program 1 times [2023-11-23 00:01:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143793522] [2023-11-23 00:01:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143793522] [2023-11-23 00:01:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143793522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:55,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:55,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:55,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547553765] [2023-11-23 00:01:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:55,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:01:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:01:55,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:01:55,739 INFO L87 Difference]: Start difference. First operand 554 states and 820 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:56,312 INFO L93 Difference]: Finished difference Result 1696 states and 2574 transitions. [2023-11-23 00:01:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:01:56,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-23 00:01:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:56,316 INFO L225 Difference]: With dead ends: 1696 [2023-11-23 00:01:56,317 INFO L226 Difference]: Without dead ends: 1143 [2023-11-23 00:01:56,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:01:56,321 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 855 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:56,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1108 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 00:01:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-23 00:01:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 883. [2023-11-23 00:01:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 781 states have (on average 1.555697823303457) internal successors, (1215), 880 states have internal predecessors, (1215), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1315 transitions. [2023-11-23 00:01:56,359 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1315 transitions. Word has length 20 [2023-11-23 00:01:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:56,359 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1315 transitions. [2023-11-23 00:01:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1315 transitions. [2023-11-23 00:01:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 00:01:56,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:56,363 INFO L195 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] [2023-11-23 00:01:56,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 00:01:56,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:56,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash 388531602, now seen corresponding path program 1 times [2023-11-23 00:01:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519750770] [2023-11-23 00:01:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519750770] [2023-11-23 00:01:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519750770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379006770] [2023-11-23 00:01:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:56,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:56,494 INFO L87 Difference]: Start difference. First operand 883 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:56,517 INFO L93 Difference]: Finished difference Result 1766 states and 2630 transitions. [2023-11-23 00:01:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 00:01:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:56,522 INFO L225 Difference]: With dead ends: 1766 [2023-11-23 00:01:56,522 INFO L226 Difference]: Without dead ends: 884 [2023-11-23 00:01:56,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:56,525 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 3 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:56,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:01:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2023-11-23 00:01:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 883. [2023-11-23 00:01:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 781 states have (on average 1.5544174135723432) internal successors, (1214), 880 states have internal predecessors, (1214), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1314 transitions. [2023-11-23 00:01:56,545 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1314 transitions. Word has length 23 [2023-11-23 00:01:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:56,550 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1314 transitions. [2023-11-23 00:01:56,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1314 transitions. [2023-11-23 00:01:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 00:01:56,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:56,554 INFO L195 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] [2023-11-23 00:01:56,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 00:01:56,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:56,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 646697040, now seen corresponding path program 1 times [2023-11-23 00:01:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771128551] [2023-11-23 00:01:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771128551] [2023-11-23 00:01:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771128551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:56,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:56,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789923219] [2023-11-23 00:01:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:56,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:56,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:56,602 INFO L87 Difference]: Start difference. First operand 883 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:56,732 INFO L93 Difference]: Finished difference Result 2190 states and 3254 transitions. [2023-11-23 00:01:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 00:01:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:56,736 INFO L225 Difference]: With dead ends: 2190 [2023-11-23 00:01:56,736 INFO L226 Difference]: Without dead ends: 1308 [2023-11-23 00:01:56,738 INFO L412 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 [2023-11-23 00:01:56,745 INFO L413 NwaCegarLoop]: 935 mSDtfsCounter, 532 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:56,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1373 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 00:01:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-11-23 00:01:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1224. [2023-11-23 00:01:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1122 states have (on average 1.552584670231729) internal successors, (1742), 1221 states have internal predecessors, (1742), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1842 transitions. [2023-11-23 00:01:56,767 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1842 transitions. Word has length 23 [2023-11-23 00:01:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:56,768 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1842 transitions. [2023-11-23 00:01:56,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1842 transitions. [2023-11-23 00:01:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 00:01:56,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:56,769 INFO L195 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] [2023-11-23 00:01:56,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 00:01:56,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:56,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -198274412, now seen corresponding path program 1 times [2023-11-23 00:01:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042871982] [2023-11-23 00:01:56,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042871982] [2023-11-23 00:01:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042871982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:56,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:56,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342361580] [2023-11-23 00:01:56,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:56,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:56,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:56,879 INFO L87 Difference]: Start difference. First operand 1224 states and 1842 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:57,257 INFO L93 Difference]: Finished difference Result 3151 states and 4814 transitions. [2023-11-23 00:01:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 00:01:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:57,262 INFO L225 Difference]: With dead ends: 3151 [2023-11-23 00:01:57,262 INFO L226 Difference]: Without dead ends: 1928 [2023-11-23 00:01:57,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:57,265 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 309 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:57,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 792 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:01:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2023-11-23 00:01:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1390. [2023-11-23 00:01:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1288 states have (on average 1.454192546583851) internal successors, (1873), 1387 states have internal predecessors, (1873), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1973 transitions. [2023-11-23 00:01:57,290 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1973 transitions. Word has length 23 [2023-11-23 00:01:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:57,290 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1973 transitions. [2023-11-23 00:01:57,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1973 transitions. [2023-11-23 00:01:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 00:01:57,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:57,291 INFO L195 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] [2023-11-23 00:01:57,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 00:01:57,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:57,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 502790166, now seen corresponding path program 1 times [2023-11-23 00:01:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415443018] [2023-11-23 00:01:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415443018] [2023-11-23 00:01:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415443018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:57,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:01:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509090312] [2023-11-23 00:01:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:57,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:57,314 INFO L87 Difference]: Start difference. First operand 1390 states and 1973 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:57,395 INFO L93 Difference]: Finished difference Result 4121 states and 5861 transitions. [2023-11-23 00:01:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 00:01:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:57,404 INFO L225 Difference]: With dead ends: 4121 [2023-11-23 00:01:57,404 INFO L226 Difference]: Without dead ends: 2732 [2023-11-23 00:01:57,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:57,406 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 509 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:57,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1067 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:01:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2023-11-23 00:01:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2644. [2023-11-23 00:01:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2542 states have (on average 1.43705743509048) internal successors, (3653), 2641 states have internal predecessors, (3653), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3753 transitions. [2023-11-23 00:01:57,476 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3753 transitions. Word has length 23 [2023-11-23 00:01:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3753 transitions. [2023-11-23 00:01:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3753 transitions. [2023-11-23 00:01:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 00:01:57,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:57,478 INFO L195 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] [2023-11-23 00:01:57,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 00:01:57,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:57,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1594090992, now seen corresponding path program 1 times [2023-11-23 00:01:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734446217] [2023-11-23 00:01:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:57,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734446217] [2023-11-23 00:01:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734446217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275422503] [2023-11-23 00:01:57,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:57,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:57,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:57,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:57,500 INFO L87 Difference]: Start difference. First operand 2644 states and 3753 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:57,873 INFO L93 Difference]: Finished difference Result 6112 states and 8877 transitions. [2023-11-23 00:01:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:57,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 00:01:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:57,881 INFO L225 Difference]: With dead ends: 6112 [2023-11-23 00:01:57,882 INFO L226 Difference]: Without dead ends: 3469 [2023-11-23 00:01:57,885 INFO L412 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 [2023-11-23 00:01:57,886 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 229 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:57,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 713 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:01:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2023-11-23 00:01:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3465. [2023-11-23 00:01:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3363 states have (on average 1.376746952126078) internal successors, (4630), 3462 states have internal predecessors, (4630), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4730 transitions. [2023-11-23 00:01:57,936 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4730 transitions. Word has length 24 [2023-11-23 00:01:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:57,936 INFO L495 AbstractCegarLoop]: Abstraction has 3465 states and 4730 transitions. [2023-11-23 00:01:57,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4730 transitions. [2023-11-23 00:01:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 00:01:57,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:57,937 INFO L195 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] [2023-11-23 00:01:57,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 00:01:57,937 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:57,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1855904852, now seen corresponding path program 1 times [2023-11-23 00:01:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895998263] [2023-11-23 00:01:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895998263] [2023-11-23 00:01:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895998263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:57,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890352920] [2023-11-23 00:01:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:57,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:57,958 INFO L87 Difference]: Start difference. First operand 3465 states and 4730 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:58,376 INFO L93 Difference]: Finished difference Result 7770 states and 10847 transitions. [2023-11-23 00:01:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 00:01:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:58,387 INFO L225 Difference]: With dead ends: 7770 [2023-11-23 00:01:58,387 INFO L226 Difference]: Without dead ends: 4306 [2023-11-23 00:01:58,392 INFO L412 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 [2023-11-23 00:01:58,393 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 298 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:58,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 673 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 00:01:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2023-11-23 00:01:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4302. [2023-11-23 00:01:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 4200 states have (on average 1.355952380952381) internal successors, (5695), 4299 states have internal predecessors, (5695), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5795 transitions. [2023-11-23 00:01:58,454 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5795 transitions. Word has length 24 [2023-11-23 00:01:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:58,455 INFO L495 AbstractCegarLoop]: Abstraction has 4302 states and 5795 transitions. [2023-11-23 00:01:58,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5795 transitions. [2023-11-23 00:01:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 00:01:58,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:58,455 INFO L195 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] [2023-11-23 00:01:58,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 00:01:58,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:58,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2122076635, now seen corresponding path program 1 times [2023-11-23 00:01:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631269027] [2023-11-23 00:01:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631269027] [2023-11-23 00:01:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631269027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508555750] [2023-11-23 00:01:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:58,480 INFO L87 Difference]: Start difference. First operand 4302 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:58,542 INFO L93 Difference]: Finished difference Result 8500 states and 11460 transitions. [2023-11-23 00:01:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 00:01:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:58,564 INFO L225 Difference]: With dead ends: 8500 [2023-11-23 00:01:58,565 INFO L226 Difference]: Without dead ends: 8493 [2023-11-23 00:01:58,568 INFO L412 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 [2023-11-23 00:01:58,569 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 547 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:58,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1546 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:01:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2023-11-23 00:01:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 8392. [2023-11-23 00:01:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8290 states have (on average 1.351266586248492) internal successors, (11202), 8389 states have internal predecessors, (11202), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 11302 transitions. [2023-11-23 00:01:58,710 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 11302 transitions. Word has length 25 [2023-11-23 00:01:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:58,711 INFO L495 AbstractCegarLoop]: Abstraction has 8392 states and 11302 transitions. [2023-11-23 00:01:58,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 11302 transitions. [2023-11-23 00:01:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 00:01:58,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:58,711 INFO L195 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] [2023-11-23 00:01:58,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 00:01:58,711 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:58,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1697765399, now seen corresponding path program 1 times [2023-11-23 00:01:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:58,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503429278] [2023-11-23 00:01:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503429278] [2023-11-23 00:01:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503429278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:01:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236620330] [2023-11-23 00:01:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:58,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:58,742 INFO L87 Difference]: Start difference. First operand 8392 states and 11302 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:58,836 INFO L93 Difference]: Finished difference Result 16882 states and 22700 transitions. [2023-11-23 00:01:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 00:01:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:58,863 INFO L225 Difference]: With dead ends: 16882 [2023-11-23 00:01:58,863 INFO L226 Difference]: Without dead ends: 8491 [2023-11-23 00:01:58,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:58,875 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 532 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:58,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1203 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:01:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2023-11-23 00:01:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 8390. [2023-11-23 00:01:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8290 states have (on average 1.3462002412545235) internal successors, (11160), 8387 states have internal predecessors, (11160), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 11258 transitions. [2023-11-23 00:01:59,066 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 11258 transitions. Word has length 25 [2023-11-23 00:01:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:59,066 INFO L495 AbstractCegarLoop]: Abstraction has 8390 states and 11258 transitions. [2023-11-23 00:01:59,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 11258 transitions. [2023-11-23 00:01:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 00:01:59,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:59,067 INFO L195 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] [2023-11-23 00:01:59,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 00:01:59,067 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:59,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash -816320605, now seen corresponding path program 1 times [2023-11-23 00:01:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444650014] [2023-11-23 00:01:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444650014] [2023-11-23 00:01:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444650014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:01:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941819542] [2023-11-23 00:01:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:59,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:59,091 INFO L87 Difference]: Start difference. First operand 8390 states and 11258 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:59,212 INFO L93 Difference]: Finished difference Result 24997 states and 33577 transitions. [2023-11-23 00:01:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-23 00:01:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:59,239 INFO L225 Difference]: With dead ends: 24997 [2023-11-23 00:01:59,239 INFO L226 Difference]: Without dead ends: 16608 [2023-11-23 00:01:59,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:59,255 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 525 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:59,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:01:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16608 states. [2023-11-23 00:01:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16608 to 16510. [2023-11-23 00:01:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16510 states, 16410 states have (on average 1.3410115783059111) internal successors, (22006), 16507 states have internal predecessors, (22006), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16510 states to 16510 states and 22104 transitions. [2023-11-23 00:01:59,550 INFO L78 Accepts]: Start accepts. Automaton has 16510 states and 22104 transitions. Word has length 27 [2023-11-23 00:01:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:01:59,550 INFO L495 AbstractCegarLoop]: Abstraction has 16510 states and 22104 transitions. [2023-11-23 00:01:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 16510 states and 22104 transitions. [2023-11-23 00:01:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 00:01:59,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:01:59,551 INFO L195 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] [2023-11-23 00:01:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 00:01:59,551 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:01:59,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:01:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 682758120, now seen corresponding path program 1 times [2023-11-23 00:01:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:01:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836916562] [2023-11-23 00:01:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:01:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:01:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:01:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:01:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:01:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836916562] [2023-11-23 00:01:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836916562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:01:59,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:01:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:01:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365213830] [2023-11-23 00:01:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:01:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:01:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:01:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:01:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:01:59,574 INFO L87 Difference]: Start difference. First operand 16510 states and 22104 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:01:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:01:59,888 INFO L93 Difference]: Finished difference Result 47949 states and 64443 transitions. [2023-11-23 00:01:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:01:59,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-23 00:01:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:01:59,942 INFO L225 Difference]: With dead ends: 47949 [2023-11-23 00:01:59,942 INFO L226 Difference]: Without dead ends: 31440 [2023-11-23 00:01:59,971 INFO L412 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 [2023-11-23 00:01:59,972 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 503 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:01:59,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1343 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 00:01:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31440 states. [2023-11-23 00:02:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31440 to 31351. [2023-11-23 00:02:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31351 states, 31251 states have (on average 1.3338133179738247) internal successors, (41683), 31348 states have internal predecessors, (41683), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31351 states to 31351 states and 41781 transitions. [2023-11-23 00:02:00,441 INFO L78 Accepts]: Start accepts. Automaton has 31351 states and 41781 transitions. Word has length 32 [2023-11-23 00:02:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:00,442 INFO L495 AbstractCegarLoop]: Abstraction has 31351 states and 41781 transitions. [2023-11-23 00:02:00,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31351 states and 41781 transitions. [2023-11-23 00:02:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 00:02:00,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:00,443 INFO L195 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] [2023-11-23 00:02:00,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 00:02:00,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:00,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1918149547, now seen corresponding path program 1 times [2023-11-23 00:02:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770280628] [2023-11-23 00:02:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770280628] [2023-11-23 00:02:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770280628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311554677] [2023-11-23 00:02:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:00,482 INFO L87 Difference]: Start difference. First operand 31351 states and 41781 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:01,171 INFO L93 Difference]: Finished difference Result 72726 states and 96960 transitions. [2023-11-23 00:02:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-23 00:02:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:01,254 INFO L225 Difference]: With dead ends: 72726 [2023-11-23 00:02:01,254 INFO L226 Difference]: Without dead ends: 41376 [2023-11-23 00:02:01,277 INFO L412 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 [2023-11-23 00:02:01,278 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 481 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:01,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 959 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:02:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41376 states. [2023-11-23 00:02:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41376 to 41294. [2023-11-23 00:02:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41294 states, 41194 states have (on average 1.3173277661795406) internal successors, (54266), 41291 states have internal predecessors, (54266), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41294 states to 41294 states and 54364 transitions. [2023-11-23 00:02:01,987 INFO L78 Accepts]: Start accepts. Automaton has 41294 states and 54364 transitions. Word has length 33 [2023-11-23 00:02:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:01,987 INFO L495 AbstractCegarLoop]: Abstraction has 41294 states and 54364 transitions. [2023-11-23 00:02:01,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41294 states and 54364 transitions. [2023-11-23 00:02:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 00:02:01,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:01,989 INFO L195 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] [2023-11-23 00:02:01,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 00:02:01,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:01,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1695664578, now seen corresponding path program 1 times [2023-11-23 00:02:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399121928] [2023-11-23 00:02:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399121928] [2023-11-23 00:02:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399121928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:02,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841119865] [2023-11-23 00:02:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:02,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:02,024 INFO L87 Difference]: Start difference. First operand 41294 states and 54364 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:02,497 INFO L93 Difference]: Finished difference Result 104785 states and 137715 transitions. [2023-11-23 00:02:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-23 00:02:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:02,611 INFO L225 Difference]: With dead ends: 104785 [2023-11-23 00:02:02,611 INFO L226 Difference]: Without dead ends: 63492 [2023-11-23 00:02:02,645 INFO L412 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 [2023-11-23 00:02:02,646 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 439 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:02,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1436 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 00:02:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63492 states. [2023-11-23 00:02:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63492 to 59564. [2023-11-23 00:02:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59564 states, 59464 states have (on average 1.2840542176779228) internal successors, (76355), 59561 states have internal predecessors, (76355), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59564 states to 59564 states and 76453 transitions. [2023-11-23 00:02:03,518 INFO L78 Accepts]: Start accepts. Automaton has 59564 states and 76453 transitions. Word has length 39 [2023-11-23 00:02:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:03,519 INFO L495 AbstractCegarLoop]: Abstraction has 59564 states and 76453 transitions. [2023-11-23 00:02:03,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59564 states and 76453 transitions. [2023-11-23 00:02:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 00:02:03,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:03,521 INFO L195 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] [2023-11-23 00:02:03,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 00:02:03,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:03,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash 166601594, now seen corresponding path program 1 times [2023-11-23 00:02:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:03,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156072657] [2023-11-23 00:02:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:03,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:03,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156072657] [2023-11-23 00:02:03,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156072657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:02:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75763010] [2023-11-23 00:02:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:03,558 INFO L87 Difference]: Start difference. First operand 59564 states and 76453 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:04,387 INFO L93 Difference]: Finished difference Result 156090 states and 201786 transitions. [2023-11-23 00:02:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-23 00:02:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:04,553 INFO L225 Difference]: With dead ends: 156090 [2023-11-23 00:02:04,553 INFO L226 Difference]: Without dead ends: 96527 [2023-11-23 00:02:04,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:04,603 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 449 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:04,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 978 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:02:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96527 states. [2023-11-23 00:02:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96527 to 96448. [2023-11-23 00:02:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96448 states, 96348 states have (on average 1.276445800639349) internal successors, (122983), 96445 states have internal predecessors, (122983), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96448 states to 96448 states and 123081 transitions. [2023-11-23 00:02:06,224 INFO L78 Accepts]: Start accepts. Automaton has 96448 states and 123081 transitions. Word has length 39 [2023-11-23 00:02:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:06,225 INFO L495 AbstractCegarLoop]: Abstraction has 96448 states and 123081 transitions. [2023-11-23 00:02:06,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 96448 states and 123081 transitions. [2023-11-23 00:02:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 00:02:06,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:06,225 INFO L195 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] [2023-11-23 00:02:06,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 00:02:06,226 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:06,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -47031098, now seen corresponding path program 1 times [2023-11-23 00:02:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103205096] [2023-11-23 00:02:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103205096] [2023-11-23 00:02:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103205096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72822855] [2023-11-23 00:02:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:06,295 INFO L87 Difference]: Start difference. First operand 96448 states and 123081 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:07,050 INFO L93 Difference]: Finished difference Result 172891 states and 219988 transitions. [2023-11-23 00:02:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-11-23 00:02:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:07,285 INFO L225 Difference]: With dead ends: 172891 [2023-11-23 00:02:07,286 INFO L226 Difference]: Without dead ends: 172888 [2023-11-23 00:02:07,314 INFO L412 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 [2023-11-23 00:02:07,314 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 526 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:07,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1567 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:02:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172888 states. [2023-11-23 00:02:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172888 to 172668. [2023-11-23 00:02:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172668 states, 172568 states have (on average 1.2715393352185804) internal successors, (219427), 172665 states have internal predecessors, (219427), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172668 states to 172668 states and 219525 transitions. [2023-11-23 00:02:09,963 INFO L78 Accepts]: Start accepts. Automaton has 172668 states and 219525 transitions. Word has length 44 [2023-11-23 00:02:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:09,964 INFO L495 AbstractCegarLoop]: Abstraction has 172668 states and 219525 transitions. [2023-11-23 00:02:09,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 172668 states and 219525 transitions. [2023-11-23 00:02:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 00:02:09,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:09,965 INFO L195 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] [2023-11-23 00:02:09,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 00:02:09,965 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:09,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2000323693, now seen corresponding path program 1 times [2023-11-23 00:02:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105510898] [2023-11-23 00:02:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:10,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:10,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105510898] [2023-11-23 00:02:10,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105510898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:10,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468946045] [2023-11-23 00:02:10,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:10,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:02:10,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:02:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:02:10,025 INFO L87 Difference]: Start difference. First operand 172668 states and 219525 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:11,924 INFO L93 Difference]: Finished difference Result 451351 states and 573250 transitions. [2023-11-23 00:02:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:02:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-23 00:02:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:12,731 INFO L225 Difference]: With dead ends: 451351 [2023-11-23 00:02:12,732 INFO L226 Difference]: Without dead ends: 278684 [2023-11-23 00:02:12,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:02:12,803 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 862 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:12,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 717 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 00:02:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278684 states. [2023-11-23 00:02:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278684 to 172663. [2023-11-23 00:02:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172663 states, 172568 states have (on average 1.2614563534374854) internal successors, (217687), 172660 states have internal predecessors, (217687), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172663 states to 172663 states and 217780 transitions. [2023-11-23 00:02:15,372 INFO L78 Accepts]: Start accepts. Automaton has 172663 states and 217780 transitions. Word has length 47 [2023-11-23 00:02:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:15,372 INFO L495 AbstractCegarLoop]: Abstraction has 172663 states and 217780 transitions. [2023-11-23 00:02:15,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 172663 states and 217780 transitions. [2023-11-23 00:02:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 00:02:15,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:15,374 INFO L195 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] [2023-11-23 00:02:15,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 00:02:15,374 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:15,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1428399207, now seen corresponding path program 1 times [2023-11-23 00:02:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695905236] [2023-11-23 00:02:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695905236] [2023-11-23 00:02:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695905236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:15,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:15,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876548008] [2023-11-23 00:02:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:15,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:15,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:15,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:15,422 INFO L87 Difference]: Start difference. First operand 172663 states and 217780 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:17,067 INFO L93 Difference]: Finished difference Result 341099 states and 430506 transitions. [2023-11-23 00:02:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-11-23 00:02:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:17,318 INFO L225 Difference]: With dead ends: 341099 [2023-11-23 00:02:17,319 INFO L226 Difference]: Without dead ends: 168437 [2023-11-23 00:02:17,434 INFO L412 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 [2023-11-23 00:02:17,440 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:17,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 355 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:02:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168437 states. [2023-11-23 00:02:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168437 to 89205. [2023-11-23 00:02:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89205 states, 89110 states have (on average 1.2030972954774997) internal successors, (107208), 89202 states have internal predecessors, (107208), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89205 states to 89205 states and 107301 transitions. [2023-11-23 00:02:19,403 INFO L78 Accepts]: Start accepts. Automaton has 89205 states and 107301 transitions. Word has length 57 [2023-11-23 00:02:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:19,403 INFO L495 AbstractCegarLoop]: Abstraction has 89205 states and 107301 transitions. [2023-11-23 00:02:19,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 89205 states and 107301 transitions. [2023-11-23 00:02:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 00:02:19,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:19,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:02:19,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 00:02:19,405 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:19,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash -883141712, now seen corresponding path program 1 times [2023-11-23 00:02:19,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:19,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588734094] [2023-11-23 00:02:19,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:19,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588734094] [2023-11-23 00:02:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588734094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001732799] [2023-11-23 00:02:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:19,461 INFO L87 Difference]: Start difference. First operand 89205 states and 107301 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:19,933 INFO L93 Difference]: Finished difference Result 127428 states and 152501 transitions. [2023-11-23 00:02:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2023-11-23 00:02:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:20,113 INFO L225 Difference]: With dead ends: 127428 [2023-11-23 00:02:20,113 INFO L226 Difference]: Without dead ends: 127423 [2023-11-23 00:02:20,155 INFO L412 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 [2023-11-23 00:02:20,156 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 444 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:20,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1255 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:02:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127423 states. [2023-11-23 00:02:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127423 to 127210. [2023-11-23 00:02:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127210 states, 127115 states have (on average 1.1919757699720726) internal successors, (151518), 127207 states have internal predecessors, (151518), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127210 states to 127210 states and 151611 transitions. [2023-11-23 00:02:22,035 INFO L78 Accepts]: Start accepts. Automaton has 127210 states and 151611 transitions. Word has length 112 [2023-11-23 00:02:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:22,035 INFO L495 AbstractCegarLoop]: Abstraction has 127210 states and 151611 transitions. [2023-11-23 00:02:22,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 127210 states and 151611 transitions. [2023-11-23 00:02:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 00:02:22,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:22,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:02:22,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 00:02:22,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:22,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1720004066, now seen corresponding path program 1 times [2023-11-23 00:02:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673577646] [2023-11-23 00:02:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 00:02:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673577646] [2023-11-23 00:02:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673577646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070787329] [2023-11-23 00:02:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:22,169 INFO L87 Difference]: Start difference. First operand 127210 states and 151611 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:23,592 INFO L93 Difference]: Finished difference Result 273603 states and 330310 transitions. [2023-11-23 00:02:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:23,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2023-11-23 00:02:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:23,807 INFO L225 Difference]: With dead ends: 273603 [2023-11-23 00:02:23,807 INFO L226 Difference]: Without dead ends: 146514 [2023-11-23 00:02:23,850 INFO L412 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 [2023-11-23 00:02:23,851 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 321 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:23,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 512 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 00:02:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2023-11-23 00:02:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 146206. [2023-11-23 00:02:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146206 states, 146111 states have (on average 1.1940237216910432) internal successors, (174460), 146203 states have internal predecessors, (174460), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146206 states to 146206 states and 174553 transitions. [2023-11-23 00:02:25,691 INFO L78 Accepts]: Start accepts. Automaton has 146206 states and 174553 transitions. Word has length 142 [2023-11-23 00:02:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:25,691 INFO L495 AbstractCegarLoop]: Abstraction has 146206 states and 174553 transitions. [2023-11-23 00:02:25,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 146206 states and 174553 transitions. [2023-11-23 00:02:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-23 00:02:25,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:25,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:02:25,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 00:02:25,694 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:25,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 17048110, now seen corresponding path program 1 times [2023-11-23 00:02:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:25,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707361107] [2023-11-23 00:02:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 00:02:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707361107] [2023-11-23 00:02:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707361107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:26,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:26,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:02:26,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311025676] [2023-11-23 00:02:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:26,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:02:26,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:02:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:26,540 INFO L87 Difference]: Start difference. First operand 146206 states and 174553 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:28,117 INFO L93 Difference]: Finished difference Result 421121 states and 503082 transitions. [2023-11-23 00:02:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:02:28,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-11-23 00:02:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:02:28,559 INFO L225 Difference]: With dead ends: 421121 [2023-11-23 00:02:28,560 INFO L226 Difference]: Without dead ends: 275036 [2023-11-23 00:02:28,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:02:28,629 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 511 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:02:28,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 910 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 00:02:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275036 states. [2023-11-23 00:02:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275036 to 274849. [2023-11-23 00:02:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274849 states, 274754 states have (on average 1.1923830044330566) internal successors, (327612), 274846 states have internal predecessors, (327612), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274849 states to 274849 states and 327705 transitions. [2023-11-23 00:02:32,415 INFO L78 Accepts]: Start accepts. Automaton has 274849 states and 327705 transitions. Word has length 144 [2023-11-23 00:02:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:02:32,416 INFO L495 AbstractCegarLoop]: Abstraction has 274849 states and 327705 transitions. [2023-11-23 00:02:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 274849 states and 327705 transitions. [2023-11-23 00:02:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-23 00:02:32,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:02:32,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:02:32,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 00:02:32,421 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:02:32,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:02:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 260470623, now seen corresponding path program 1 times [2023-11-23 00:02:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:02:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937583387] [2023-11-23 00:02:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:02:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:02:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:02:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:02:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:02:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937583387] [2023-11-23 00:02:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937583387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:02:32,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:02:32,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 00:02:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947733790] [2023-11-23 00:02:32,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:02:32,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:02:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:02:32,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:02:32,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:02:32,489 INFO L87 Difference]: Start difference. First operand 274849 states and 327705 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:02:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:02:36,407 INFO L93 Difference]: Finished difference Result 744447 states and 886319 transitions. [2023-11-23 00:02:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:02:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2023-11-23 00:02:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.