./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-22 21:21:23,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:21:23,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:21:23,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:21:23,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:21:23,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:21:23,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:21:23,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:21:23,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:21:23,116 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:21:23,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:21:23,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:21:23,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:21:23,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:21:23,118 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:21:23,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:21:23,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:21:23,119 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:21:23,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:21:23,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:21:23,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:21:23,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:21:23,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:21:23,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:21:23,121 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:21:23,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:21:23,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:21:23,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:21:23,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:21:23,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:21:23,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:21:23,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:21:23,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:21:23,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:21:23,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:21:23,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:21:23,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:21:23,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:21:23,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:21:23,125 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:21:23,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:21:23,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:21:23,126 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-22 21:21:23,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:21:23,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:21:23,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:21:23,308 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:21:23,309 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:21:23,309 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-22 21:21:24,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:21:24,552 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:21:24,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2018/Problem10.c [2023-11-22 21:21:24,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f2f7629/ad43e8de9c8a41b98626b9ecafa1fa04/FLAG82a1e1d14 [2023-11-22 21:21:24,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f2f7629/ad43e8de9c8a41b98626b9ecafa1fa04 [2023-11-22 21:21:24,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:21:24,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:21:24,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:21:24,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:21:24,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:21:24,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:21:24" (1/1) ... [2023-11-22 21:21:24,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7361969e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:24, skipping insertion in model container [2023-11-22 21:21:24,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:21:24" (1/1) ... [2023-11-22 21:21:24,635 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:21:24,727 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-22 21:21:24,733 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-22 21:21:25,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:21:25,099 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:21:25,108 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-22 21:21:25,108 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-22 21:21:25,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:21:25,231 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:21:25,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25 WrapperNode [2023-11-22 21:21:25,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:21:25,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:21:25,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:21:25,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:21:25,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,306 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 866 [2023-11-22 21:21:25,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:21:25,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:21:25,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:21:25,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:21:25,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:21:25,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:21:25,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:21:25,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:21:25,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (1/1) ... [2023-11-22 21:21:25,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:21:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:21:25,435 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-22 21:21:25,443 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-22 21:21:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:21:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2023-11-22 21:21:25,478 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2023-11-22 21:21:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2023-11-22 21:21:25,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2023-11-22 21:21:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:21:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:21:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:21:25,568 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:21:25,570 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:21:26,320 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:21:26,357 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:21:26,361 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:21:26,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:21:26 BoogieIcfgContainer [2023-11-22 21:21:26,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:21:26,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:21:26,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:21:26,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:21:26,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:21:24" (1/3) ... [2023-11-22 21:21:26,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a731a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:21:26, skipping insertion in model container [2023-11-22 21:21:26,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:21:25" (2/3) ... [2023-11-22 21:21:26,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a731a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:21:26, skipping insertion in model container [2023-11-22 21:21:26,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:21:26" (3/3) ... [2023-11-22 21:21:26,372 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2023-11-22 21:21:26,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:21:26,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-22 21:21:26,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:21:26,446 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;@79512ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:21:26,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-22 21:21:26,453 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-22 21:21:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 21:21:26,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:26,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:21:26,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:26,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -973882549, now seen corresponding path program 1 times [2023-11-22 21:21:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139403007] [2023-11-22 21:21:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:26,656 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-22 21:21:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139403007] [2023-11-22 21:21:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139403007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059609979] [2023-11-22 21:21:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:26,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:21:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:21:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:21:26,684 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-22 21:21:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:27,482 INFO L93 Difference]: Finished difference Result 1154 states and 2058 transitions. [2023-11-22 21:21:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:21:27,485 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-22 21:21:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:27,495 INFO L225 Difference]: With dead ends: 1154 [2023-11-22 21:21:27,495 INFO L226 Difference]: Without dead ends: 686 [2023-11-22 21:21:27,500 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-22 21:21:27,502 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-22 21:21:27,502 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-22 21:21:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-11-22 21:21:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 554. [2023-11-22 21:21:27,548 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-22 21:21:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 820 transitions. [2023-11-22 21:21:27,551 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 820 transitions. Word has length 12 [2023-11-22 21:21:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:27,551 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 820 transitions. [2023-11-22 21:21:27,552 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-22 21:21:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 820 transitions. [2023-11-22 21:21:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 21:21:27,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:27,553 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-22 21:21:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:21:27,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:27,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1176212298, now seen corresponding path program 1 times [2023-11-22 21:21:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036190327] [2023-11-22 21:21:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:27,606 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-22 21:21:27,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036190327] [2023-11-22 21:21:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036190327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:27,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:27,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550721639] [2023-11-22 21:21:27,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:27,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:21:27,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:21:27,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:21:27,610 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-22 21:21:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:28,158 INFO L93 Difference]: Finished difference Result 1696 states and 2574 transitions. [2023-11-22 21:21:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:21:28,160 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-22 21:21:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:28,163 INFO L225 Difference]: With dead ends: 1696 [2023-11-22 21:21:28,163 INFO L226 Difference]: Without dead ends: 1143 [2023-11-22 21:21:28,165 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-22 21:21:28,166 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-22 21:21:28,166 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-22 21:21:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-22 21:21:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 883. [2023-11-22 21:21:28,198 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-22 21:21:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1315 transitions. [2023-11-22 21:21:28,201 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1315 transitions. Word has length 20 [2023-11-22 21:21:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:28,201 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1315 transitions. [2023-11-22 21:21:28,201 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-22 21:21:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1315 transitions. [2023-11-22 21:21:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:21:28,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:28,202 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-22 21:21:28,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:21:28,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:28,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash 388531602, now seen corresponding path program 1 times [2023-11-22 21:21:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:28,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788031708] [2023-11-22 21:21:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:28,285 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-22 21:21:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:28,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788031708] [2023-11-22 21:21:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788031708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:28,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886511462] [2023-11-22 21:21:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:28,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:28,287 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-22 21:21:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:28,309 INFO L93 Difference]: Finished difference Result 1766 states and 2630 transitions. [2023-11-22 21:21:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:28,310 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-22 21:21:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:28,312 INFO L225 Difference]: With dead ends: 1766 [2023-11-22 21:21:28,313 INFO L226 Difference]: Without dead ends: 884 [2023-11-22 21:21:28,314 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-22 21:21:28,315 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-22 21:21:28,315 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-22 21:21:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2023-11-22 21:21:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 883. [2023-11-22 21:21:28,326 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-22 21:21:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1314 transitions. [2023-11-22 21:21:28,329 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1314 transitions. Word has length 23 [2023-11-22 21:21:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:28,329 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1314 transitions. [2023-11-22 21:21:28,329 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-22 21:21:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1314 transitions. [2023-11-22 21:21:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:21:28,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:28,330 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-22 21:21:28,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:21:28,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:28,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 646697040, now seen corresponding path program 1 times [2023-11-22 21:21:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980271060] [2023-11-22 21:21:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:28,393 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-22 21:21:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980271060] [2023-11-22 21:21:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980271060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680456998] [2023-11-22 21:21:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:28,395 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-22 21:21:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:28,532 INFO L93 Difference]: Finished difference Result 2190 states and 3254 transitions. [2023-11-22 21:21:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:28,533 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-22 21:21:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:28,536 INFO L225 Difference]: With dead ends: 2190 [2023-11-22 21:21:28,536 INFO L226 Difference]: Without dead ends: 1308 [2023-11-22 21:21:28,538 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-22 21:21:28,538 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-22 21:21:28,539 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-22 21:21:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-11-22 21:21:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1224. [2023-11-22 21:21:28,554 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-22 21:21:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1842 transitions. [2023-11-22 21:21:28,557 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1842 transitions. Word has length 23 [2023-11-22 21:21:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:28,557 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1842 transitions. [2023-11-22 21:21:28,557 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-22 21:21:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1842 transitions. [2023-11-22 21:21:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:21:28,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:28,570 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-22 21:21:28,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:21:28,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:28,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash -198274412, now seen corresponding path program 1 times [2023-11-22 21:21:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906158676] [2023-11-22 21:21:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:28,653 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-22 21:21:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906158676] [2023-11-22 21:21:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906158676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815761745] [2023-11-22 21:21:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:28,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:28,655 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-22 21:21:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:29,049 INFO L93 Difference]: Finished difference Result 3151 states and 4814 transitions. [2023-11-22 21:21:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:29,050 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-22 21:21:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:29,055 INFO L225 Difference]: With dead ends: 3151 [2023-11-22 21:21:29,055 INFO L226 Difference]: Without dead ends: 1928 [2023-11-22 21:21:29,057 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-22 21:21:29,060 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.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:29,061 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.4s Time] [2023-11-22 21:21:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2023-11-22 21:21:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1390. [2023-11-22 21:21:29,085 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-22 21:21:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1973 transitions. [2023-11-22 21:21:29,088 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1973 transitions. Word has length 23 [2023-11-22 21:21:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:29,088 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1973 transitions. [2023-11-22 21:21:29,089 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-22 21:21:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1973 transitions. [2023-11-22 21:21:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:21:29,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:29,091 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-22 21:21:29,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:21:29,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:29,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash 502790166, now seen corresponding path program 1 times [2023-11-22 21:21:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386675388] [2023-11-22 21:21:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:29,135 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-22 21:21:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386675388] [2023-11-22 21:21:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386675388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:29,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:29,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:21:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663588215] [2023-11-22 21:21:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:29,138 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-22 21:21:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:29,223 INFO L93 Difference]: Finished difference Result 4121 states and 5861 transitions. [2023-11-22 21:21:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:29,223 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-22 21:21:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:29,231 INFO L225 Difference]: With dead ends: 4121 [2023-11-22 21:21:29,231 INFO L226 Difference]: Without dead ends: 2732 [2023-11-22 21:21:29,233 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-22 21:21:29,239 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-22 21:21:29,239 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-22 21:21:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2023-11-22 21:21:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2644. [2023-11-22 21:21:29,278 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-22 21:21:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3753 transitions. [2023-11-22 21:21:29,312 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3753 transitions. Word has length 23 [2023-11-22 21:21:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:29,313 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3753 transitions. [2023-11-22 21:21:29,313 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-22 21:21:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3753 transitions. [2023-11-22 21:21:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:21:29,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:29,313 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-22 21:21:29,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 21:21:29,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:29,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1594090992, now seen corresponding path program 1 times [2023-11-22 21:21:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070942070] [2023-11-22 21:21:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:29,349 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-22 21:21:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070942070] [2023-11-22 21:21:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070942070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:29,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558268503] [2023-11-22 21:21:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:29,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:29,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:29,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:29,351 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-22 21:21:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:29,718 INFO L93 Difference]: Finished difference Result 6112 states and 8877 transitions. [2023-11-22 21:21:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:29,719 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-22 21:21:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:29,727 INFO L225 Difference]: With dead ends: 6112 [2023-11-22 21:21:29,727 INFO L226 Difference]: Without dead ends: 3469 [2023-11-22 21:21:29,729 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-22 21:21:29,730 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-22 21:21:29,731 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-22 21:21:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2023-11-22 21:21:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3465. [2023-11-22 21:21:29,770 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-22 21:21:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4730 transitions. [2023-11-22 21:21:29,781 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4730 transitions. Word has length 24 [2023-11-22 21:21:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:29,781 INFO L495 AbstractCegarLoop]: Abstraction has 3465 states and 4730 transitions. [2023-11-22 21:21:29,781 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-22 21:21:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4730 transitions. [2023-11-22 21:21:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:21:29,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:29,782 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-22 21:21:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 21:21:29,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:29,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1855904852, now seen corresponding path program 1 times [2023-11-22 21:21:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977194547] [2023-11-22 21:21:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:29,816 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-22 21:21:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977194547] [2023-11-22 21:21:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977194547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:29,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080462801] [2023-11-22 21:21:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:29,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:29,819 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-22 21:21:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:30,195 INFO L93 Difference]: Finished difference Result 7770 states and 10847 transitions. [2023-11-22 21:21:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:30,196 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-22 21:21:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:30,207 INFO L225 Difference]: With dead ends: 7770 [2023-11-22 21:21:30,207 INFO L226 Difference]: Without dead ends: 4306 [2023-11-22 21:21:30,212 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-22 21:21:30,213 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.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:30,214 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.3s Time] [2023-11-22 21:21:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2023-11-22 21:21:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4302. [2023-11-22 21:21:30,292 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-22 21:21:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5795 transitions. [2023-11-22 21:21:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5795 transitions. Word has length 24 [2023-11-22 21:21:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:30,300 INFO L495 AbstractCegarLoop]: Abstraction has 4302 states and 5795 transitions. [2023-11-22 21:21:30,300 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-22 21:21:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5795 transitions. [2023-11-22 21:21:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:21:30,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:30,302 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-22 21:21:30,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:21:30,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:30,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2122076635, now seen corresponding path program 1 times [2023-11-22 21:21:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060016173] [2023-11-22 21:21:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:30,329 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-22 21:21:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060016173] [2023-11-22 21:21:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060016173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:30,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534042519] [2023-11-22 21:21:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:30,333 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-22 21:21:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:30,395 INFO L93 Difference]: Finished difference Result 8500 states and 11460 transitions. [2023-11-22 21:21:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:30,396 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-22 21:21:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:30,423 INFO L225 Difference]: With dead ends: 8500 [2023-11-22 21:21:30,424 INFO L226 Difference]: Without dead ends: 8493 [2023-11-22 21:21:30,427 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-22 21:21:30,429 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-22 21:21:30,429 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-22 21:21:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2023-11-22 21:21:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 8392. [2023-11-22 21:21:30,534 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-22 21:21:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 11302 transitions. [2023-11-22 21:21:30,548 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 11302 transitions. Word has length 25 [2023-11-22 21:21:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:30,548 INFO L495 AbstractCegarLoop]: Abstraction has 8392 states and 11302 transitions. [2023-11-22 21:21:30,548 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-22 21:21:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 11302 transitions. [2023-11-22 21:21:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:21:30,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:30,549 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-22 21:21:30,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 21:21:30,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:30,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1697765399, now seen corresponding path program 1 times [2023-11-22 21:21:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:30,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734033544] [2023-11-22 21:21:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:30,581 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-22 21:21:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734033544] [2023-11-22 21:21:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734033544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:21:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121896789] [2023-11-22 21:21:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:30,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:30,585 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-22 21:21:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:30,703 INFO L93 Difference]: Finished difference Result 16882 states and 22700 transitions. [2023-11-22 21:21:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:30,704 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-22 21:21:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:30,724 INFO L225 Difference]: With dead ends: 16882 [2023-11-22 21:21:30,724 INFO L226 Difference]: Without dead ends: 8491 [2023-11-22 21:21:30,733 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-22 21:21:30,734 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-22 21:21:30,735 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-22 21:21:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2023-11-22 21:21:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 8390. [2023-11-22 21:21:30,869 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-22 21:21:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 11258 transitions. [2023-11-22 21:21:30,907 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 11258 transitions. Word has length 25 [2023-11-22 21:21:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:30,907 INFO L495 AbstractCegarLoop]: Abstraction has 8390 states and 11258 transitions. [2023-11-22 21:21:30,908 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-22 21:21:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 11258 transitions. [2023-11-22 21:21:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 21:21:30,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:30,908 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-22 21:21:30,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:21:30,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:30,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -816320605, now seen corresponding path program 1 times [2023-11-22 21:21:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973232499] [2023-11-22 21:21:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:30,948 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-22 21:21:30,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973232499] [2023-11-22 21:21:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973232499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:21:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594085953] [2023-11-22 21:21:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:30,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:30,959 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-22 21:21:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:31,177 INFO L93 Difference]: Finished difference Result 24997 states and 33577 transitions. [2023-11-22 21:21:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:31,178 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-22 21:21:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:31,201 INFO L225 Difference]: With dead ends: 24997 [2023-11-22 21:21:31,201 INFO L226 Difference]: Without dead ends: 16608 [2023-11-22 21:21:31,214 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-22 21:21:31,215 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:31,215 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.1s Time] [2023-11-22 21:21:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16608 states. [2023-11-22 21:21:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16608 to 16510. [2023-11-22 21:21:31,427 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-22 21:21:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16510 states to 16510 states and 22104 transitions. [2023-11-22 21:21:31,453 INFO L78 Accepts]: Start accepts. Automaton has 16510 states and 22104 transitions. Word has length 27 [2023-11-22 21:21:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:31,453 INFO L495 AbstractCegarLoop]: Abstraction has 16510 states and 22104 transitions. [2023-11-22 21:21:31,453 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-22 21:21:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 16510 states and 22104 transitions. [2023-11-22 21:21:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 21:21:31,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:31,454 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-22 21:21:31,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 21:21:31,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:31,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 682758120, now seen corresponding path program 1 times [2023-11-22 21:21:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:31,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849864081] [2023-11-22 21:21:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:31,475 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-22 21:21:31,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:31,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849864081] [2023-11-22 21:21:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849864081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449118211] [2023-11-22 21:21:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:31,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:31,477 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-22 21:21:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:31,689 INFO L93 Difference]: Finished difference Result 47949 states and 64443 transitions. [2023-11-22 21:21:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:31,689 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-22 21:21:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:31,737 INFO L225 Difference]: With dead ends: 47949 [2023-11-22 21:21:31,737 INFO L226 Difference]: Without dead ends: 31440 [2023-11-22 21:21:31,759 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-22 21:21:31,759 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 503 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-22 21:21:31,760 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-22 21:21:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31440 states. [2023-11-22 21:21:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31440 to 31351. [2023-11-22 21:21:32,252 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-22 21:21:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31351 states to 31351 states and 41781 transitions. [2023-11-22 21:21:32,302 INFO L78 Accepts]: Start accepts. Automaton has 31351 states and 41781 transitions. Word has length 32 [2023-11-22 21:21:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:32,302 INFO L495 AbstractCegarLoop]: Abstraction has 31351 states and 41781 transitions. [2023-11-22 21:21:32,303 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-22 21:21:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31351 states and 41781 transitions. [2023-11-22 21:21:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 21:21:32,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:32,304 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-22 21:21:32,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 21:21:32,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:32,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1918149547, now seen corresponding path program 1 times [2023-11-22 21:21:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218339796] [2023-11-22 21:21:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:32,433 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-22 21:21:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218339796] [2023-11-22 21:21:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218339796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:32,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659145233] [2023-11-22 21:21:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:32,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:32,436 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-22 21:21:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:32,827 INFO L93 Difference]: Finished difference Result 72726 states and 96960 transitions. [2023-11-22 21:21:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:32,828 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-22 21:21:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:32,896 INFO L225 Difference]: With dead ends: 72726 [2023-11-22 21:21:32,897 INFO L226 Difference]: Without dead ends: 41376 [2023-11-22 21:21:32,929 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-22 21:21:32,930 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 481 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:32,930 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.1s Time] [2023-11-22 21:21:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41376 states. [2023-11-22 21:21:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41376 to 41294. [2023-11-22 21:21:33,471 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-22 21:21:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41294 states to 41294 states and 54364 transitions. [2023-11-22 21:21:33,679 INFO L78 Accepts]: Start accepts. Automaton has 41294 states and 54364 transitions. Word has length 33 [2023-11-22 21:21:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:33,680 INFO L495 AbstractCegarLoop]: Abstraction has 41294 states and 54364 transitions. [2023-11-22 21:21:33,680 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-22 21:21:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 41294 states and 54364 transitions. [2023-11-22 21:21:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 21:21:33,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:33,681 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-22 21:21:33,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:21:33,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:33,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1695664578, now seen corresponding path program 1 times [2023-11-22 21:21:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825128847] [2023-11-22 21:21:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:33,728 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-22 21:21:33,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825128847] [2023-11-22 21:21:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825128847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395530027] [2023-11-22 21:21:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:33,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:33,730 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-22 21:21:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:34,466 INFO L93 Difference]: Finished difference Result 104785 states and 137715 transitions. [2023-11-22 21:21:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:34,466 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-22 21:21:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:34,576 INFO L225 Difference]: With dead ends: 104785 [2023-11-22 21:21:34,577 INFO L226 Difference]: Without dead ends: 63492 [2023-11-22 21:21:34,598 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-22 21:21:34,599 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:34,599 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.2s Time] [2023-11-22 21:21:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63492 states. [2023-11-22 21:21:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63492 to 59564. [2023-11-22 21:21:35,450 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-22 21:21:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59564 states to 59564 states and 76453 transitions. [2023-11-22 21:21:35,550 INFO L78 Accepts]: Start accepts. Automaton has 59564 states and 76453 transitions. Word has length 39 [2023-11-22 21:21:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:35,552 INFO L495 AbstractCegarLoop]: Abstraction has 59564 states and 76453 transitions. [2023-11-22 21:21:35,552 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-22 21:21:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 59564 states and 76453 transitions. [2023-11-22 21:21:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 21:21:35,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:35,553 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-22 21:21:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 21:21:35,553 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:35,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 166601594, now seen corresponding path program 1 times [2023-11-22 21:21:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78854305] [2023-11-22 21:21:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:35,591 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-22 21:21:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78854305] [2023-11-22 21:21:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78854305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:35,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:21:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526191740] [2023-11-22 21:21:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:35,593 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-22 21:21:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:36,519 INFO L93 Difference]: Finished difference Result 156090 states and 201786 transitions. [2023-11-22 21:21:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:36,528 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-22 21:21:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:36,746 INFO L225 Difference]: With dead ends: 156090 [2023-11-22 21:21:36,746 INFO L226 Difference]: Without dead ends: 96527 [2023-11-22 21:21:36,769 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-22 21:21:36,769 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 449 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:36,770 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.1s Time] [2023-11-22 21:21:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96527 states. [2023-11-22 21:21:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96527 to 96448. [2023-11-22 21:21:37,988 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-22 21:21:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96448 states to 96448 states and 123081 transitions. [2023-11-22 21:21:38,174 INFO L78 Accepts]: Start accepts. Automaton has 96448 states and 123081 transitions. Word has length 39 [2023-11-22 21:21:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:38,174 INFO L495 AbstractCegarLoop]: Abstraction has 96448 states and 123081 transitions. [2023-11-22 21:21:38,174 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-22 21:21:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 96448 states and 123081 transitions. [2023-11-22 21:21:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 21:21:38,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:38,175 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-22 21:21:38,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 21:21:38,175 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:38,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -47031098, now seen corresponding path program 1 times [2023-11-22 21:21:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826731058] [2023-11-22 21:21:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:38,234 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-22 21:21:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826731058] [2023-11-22 21:21:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826731058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866225111] [2023-11-22 21:21:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:38,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:38,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:38,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:38,238 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-22 21:21:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:39,003 INFO L93 Difference]: Finished difference Result 172891 states and 219988 transitions. [2023-11-22 21:21:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:39,003 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-22 21:21:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:39,226 INFO L225 Difference]: With dead ends: 172891 [2023-11-22 21:21:39,226 INFO L226 Difference]: Without dead ends: 172888 [2023-11-22 21:21:39,254 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-22 21:21:39,255 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-22 21:21:39,255 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-22 21:21:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172888 states. [2023-11-22 21:21:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172888 to 172668. [2023-11-22 21:21:40,995 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-22 21:21:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172668 states to 172668 states and 219525 transitions. [2023-11-22 21:21:41,636 INFO L78 Accepts]: Start accepts. Automaton has 172668 states and 219525 transitions. Word has length 44 [2023-11-22 21:21:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:41,637 INFO L495 AbstractCegarLoop]: Abstraction has 172668 states and 219525 transitions. [2023-11-22 21:21:41,637 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-22 21:21:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 172668 states and 219525 transitions. [2023-11-22 21:21:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 21:21:41,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:41,637 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-22 21:21:41,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 21:21:41,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:41,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2000323693, now seen corresponding path program 1 times [2023-11-22 21:21:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833837530] [2023-11-22 21:21:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:41,692 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-22 21:21:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833837530] [2023-11-22 21:21:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833837530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255827309] [2023-11-22 21:21:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:21:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:41,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:21:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:21:41,694 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-22 21:21:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:43,841 INFO L93 Difference]: Finished difference Result 451351 states and 573250 transitions. [2023-11-22 21:21:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:21:43,849 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-22 21:21:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:44,317 INFO L225 Difference]: With dead ends: 451351 [2023-11-22 21:21:44,318 INFO L226 Difference]: Without dead ends: 278684 [2023-11-22 21:21:44,416 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-22 21:21:44,417 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 862 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:44,417 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.5s Time] [2023-11-22 21:21:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278684 states. [2023-11-22 21:21:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278684 to 172663. [2023-11-22 21:21:47,298 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-22 21:21:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172663 states to 172663 states and 217780 transitions. [2023-11-22 21:21:47,575 INFO L78 Accepts]: Start accepts. Automaton has 172663 states and 217780 transitions. Word has length 47 [2023-11-22 21:21:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 172663 states and 217780 transitions. [2023-11-22 21:21:47,575 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-22 21:21:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 172663 states and 217780 transitions. [2023-11-22 21:21:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 21:21:47,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:47,576 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-22 21:21:47,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 21:21:47,576 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:47,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1428399207, now seen corresponding path program 1 times [2023-11-22 21:21:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002391591] [2023-11-22 21:21:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:47,615 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-22 21:21:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002391591] [2023-11-22 21:21:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002391591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069841998] [2023-11-22 21:21:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:47,617 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-22 21:21:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:49,224 INFO L93 Difference]: Finished difference Result 341099 states and 430506 transitions. [2023-11-22 21:21:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:49,224 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-22 21:21:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:49,491 INFO L225 Difference]: With dead ends: 341099 [2023-11-22 21:21:49,491 INFO L226 Difference]: Without dead ends: 168437 [2023-11-22 21:21:49,597 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-22 21:21:49,598 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-22 21:21:49,598 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-22 21:21:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168437 states. [2023-11-22 21:21:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168437 to 89205. [2023-11-22 21:21:50,962 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-22 21:21:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89205 states to 89205 states and 107301 transitions. [2023-11-22 21:21:51,068 INFO L78 Accepts]: Start accepts. Automaton has 89205 states and 107301 transitions. Word has length 57 [2023-11-22 21:21:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:51,068 INFO L495 AbstractCegarLoop]: Abstraction has 89205 states and 107301 transitions. [2023-11-22 21:21:51,068 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-22 21:21:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 89205 states and 107301 transitions. [2023-11-22 21:21:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-22 21:21:51,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:51,070 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-22 21:21:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 21:21:51,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:51,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash -883141712, now seen corresponding path program 1 times [2023-11-22 21:21:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877109473] [2023-11-22 21:21:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:51,119 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-22 21:21:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877109473] [2023-11-22 21:21:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877109473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12341376] [2023-11-22 21:21:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:51,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:51,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:51,121 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-22 21:21:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:51,949 INFO L93 Difference]: Finished difference Result 127428 states and 152501 transitions. [2023-11-22 21:21:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:51,949 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-22 21:21:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:52,128 INFO L225 Difference]: With dead ends: 127428 [2023-11-22 21:21:52,128 INFO L226 Difference]: Without dead ends: 127423 [2023-11-22 21:21:52,171 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-22 21:21:52,172 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-22 21:21:52,172 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-22 21:21:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127423 states. [2023-11-22 21:21:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127423 to 127210. [2023-11-22 21:21:53,596 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-22 21:21:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127210 states to 127210 states and 151611 transitions. [2023-11-22 21:21:53,762 INFO L78 Accepts]: Start accepts. Automaton has 127210 states and 151611 transitions. Word has length 112 [2023-11-22 21:21:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:53,762 INFO L495 AbstractCegarLoop]: Abstraction has 127210 states and 151611 transitions. [2023-11-22 21:21:53,762 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-22 21:21:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 127210 states and 151611 transitions. [2023-11-22 21:21:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-22 21:21:53,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:53,764 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-22 21:21:53,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 21:21:53,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:53,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1720004066, now seen corresponding path program 1 times [2023-11-22 21:21:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172216556] [2023-11-22 21:21:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:54,232 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-22 21:21:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172216556] [2023-11-22 21:21:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172216556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349401023] [2023-11-22 21:21:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:54,234 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-22 21:21:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:21:55,238 INFO L93 Difference]: Finished difference Result 273603 states and 330310 transitions. [2023-11-22 21:21:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:21:55,239 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-22 21:21:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:21:55,442 INFO L225 Difference]: With dead ends: 273603 [2023-11-22 21:21:55,442 INFO L226 Difference]: Without dead ends: 146514 [2023-11-22 21:21:55,547 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-22 21:21:55,547 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.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:21:55,547 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.4s Time] [2023-11-22 21:21:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2023-11-22 21:21:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 146206. [2023-11-22 21:21:57,474 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-22 21:21:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146206 states to 146206 states and 174553 transitions. [2023-11-22 21:21:57,676 INFO L78 Accepts]: Start accepts. Automaton has 146206 states and 174553 transitions. Word has length 142 [2023-11-22 21:21:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:21:57,676 INFO L495 AbstractCegarLoop]: Abstraction has 146206 states and 174553 transitions. [2023-11-22 21:21:57,676 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-22 21:21:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 146206 states and 174553 transitions. [2023-11-22 21:21:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-22 21:21:57,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:21:57,680 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-22 21:21:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-22 21:21:57,681 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:21:57,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:21:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 17048110, now seen corresponding path program 1 times [2023-11-22 21:21:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:21:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686576092] [2023-11-22 21:21:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:21:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:21:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:21:58,009 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-22 21:21:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:21:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686576092] [2023-11-22 21:21:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686576092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:21:58,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:21:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:21:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132900403] [2023-11-22 21:21:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:21:58,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:21:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:21:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:21:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:21:58,011 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-22 21:22:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:22:00,128 INFO L93 Difference]: Finished difference Result 421121 states and 503082 transitions. [2023-11-22 21:22:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:22:00,129 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-22 21:22:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:22:00,559 INFO L225 Difference]: With dead ends: 421121 [2023-11-22 21:22:00,560 INFO L226 Difference]: Without dead ends: 275036 [2023-11-22 21:22:00,640 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-22 21:22:00,655 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:22:00,655 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.2s Time] [2023-11-22 21:22:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275036 states. [2023-11-22 21:22:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275036 to 274849. [2023-11-22 21:22:03,594 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-22 21:22:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274849 states to 274849 states and 327705 transitions. [2023-11-22 21:22:04,506 INFO L78 Accepts]: Start accepts. Automaton has 274849 states and 327705 transitions. Word has length 144 [2023-11-22 21:22:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:22:04,506 INFO L495 AbstractCegarLoop]: Abstraction has 274849 states and 327705 transitions. [2023-11-22 21:22:04,506 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-22 21:22:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 274849 states and 327705 transitions. [2023-11-22 21:22:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-22 21:22:04,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:22:04,511 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-22 21:22:04,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-22 21:22:04,513 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:22:04,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:22:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash 260470623, now seen corresponding path program 1 times [2023-11-22 21:22:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:22:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539365196] [2023-11-22 21:22:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:22:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:22:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:22:04,584 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-22 21:22:04,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:22:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539365196] [2023-11-22 21:22:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539365196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:22:04,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:22:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:22:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252425809] [2023-11-22 21:22:04,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:22:04,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:22:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:22:04,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:22:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:22:04,586 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-22 21:22:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:22:07,715 INFO L93 Difference]: Finished difference Result 744447 states and 886319 transitions. [2023-11-22 21:22:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:22:07,716 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-22 21:22:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:22:08,646 INFO L225 Difference]: With dead ends: 744447 [2023-11-22 21:22:08,646 INFO L226 Difference]: Without dead ends: 548952 [2023-11-22 21:22:09,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 21:22:09,244 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 734 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:22:09,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1620 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 21:22:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548952 states.