./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:54:32,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:54:32,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:54:32,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:54:32,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:54:32,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:54:32,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:54:32,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:54:32,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:54:32,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:54:32,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:54:32,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:54:32,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:54:32,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:54:32,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:54:32,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:54:32,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:54:32,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:54:32,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:54:32,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:54:32,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:54:32,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:54:32,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:54:32,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:54:32,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:54:32,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:54:32,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:54:32,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:54:32,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:54:32,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:54:32,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:54:32,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:54:32,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:54:32,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:54:32,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:54:32,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:54:32,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:54:32,877 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 [2024-11-08 11:54:33,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:54:33,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:54:33,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:54:33,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:54:33,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:54:33,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem10.c [2024-11-08 11:54:34,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:54:34,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:54:34,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c [2024-11-08 11:54:34,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d850fd096/7031f3e4873d49849b5c46b131587cbe/FLAG261523e0b [2024-11-08 11:54:34,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d850fd096/7031f3e4873d49849b5c46b131587cbe [2024-11-08 11:54:34,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:54:34,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:54:34,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:54:34,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:54:34,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:54:34,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:34" (1/1) ... [2024-11-08 11:54:34,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745da4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:34, skipping insertion in model container [2024-11-08 11:54:34,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:34" (1/1) ... [2024-11-08 11:54:35,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:54:35,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-11-08 11:54:35,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-11-08 11:54:35,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:54:35,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:54:35,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-11-08 11:54:35,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-11-08 11:54:35,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:54:35,781 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:54:35,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35 WrapperNode [2024-11-08 11:54:35,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:54:35,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:54:35,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:54:35,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:54:35,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,887 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 866 [2024-11-08 11:54:35,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:54:35,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:54:35,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:54:35,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:54:35,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,933 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:54:35,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:35,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:36,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:36,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:54:36,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:54:36,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:54:36,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:54:36,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (1/1) ... [2024-11-08 11:54:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:54:36,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:54:36,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:54:36,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:54:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:54:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-08 11:54:36,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-08 11:54:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-08 11:54:36,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-08 11:54:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:54:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:54:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:54:36,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:54:36,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:54:37,229 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-08 11:54:37,229 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:54:37,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:54:37,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:54:37,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:37 BoogieIcfgContainer [2024-11-08 11:54:37,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:54:37,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:54:37,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:54:37,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:54:37,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:54:34" (1/3) ... [2024-11-08 11:54:37,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d0e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:37, skipping insertion in model container [2024-11-08 11:54:37,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:35" (2/3) ... [2024-11-08 11:54:37,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d0e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:54:37, skipping insertion in model container [2024-11-08 11:54:37,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:54:37" (3/3) ... [2024-11-08 11:54:37,274 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2024-11-08 11:54:37,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:54:37,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 11:54:37,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:54:37,379 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70ee0950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:54:37,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 11:54:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 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) [2024-11-08 11:54:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 11:54:37,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:37,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:54:37,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1184212657, now seen corresponding path program 1 times [2024-11-08 11:54:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024427713] [2024-11-08 11:54:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024427713] [2024-11-08 11:54:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024427713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:37,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:37,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696916918] [2024-11-08 11:54:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:54:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:54:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:54:37,702 INFO L87 Difference]: Start difference. First operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 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 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-08 11:54:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:38,828 INFO L93 Difference]: Finished difference Result 1165 states and 2069 transitions. [2024-11-08 11:54:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:54:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-08 11:54:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:38,854 INFO L225 Difference]: With dead ends: 1165 [2024-11-08 11:54:38,854 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 11:54:38,863 INFO L431 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 [2024-11-08 11:54:38,869 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 577 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:38,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 653 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:54:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 11:54:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 557. [2024-11-08 11:54:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 455 states have (on average 1.589010989010989) internal successors, (723), 554 states have internal predecessors, (723), 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) [2024-11-08 11:54:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 823 transitions. [2024-11-08 11:54:38,974 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 823 transitions. Word has length 13 [2024-11-08 11:54:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:38,975 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 823 transitions. [2024-11-08 11:54:38,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-08 11:54:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2024-11-08 11:54:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 11:54:38,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:38,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:54:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:54:38,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash -249172658, now seen corresponding path program 1 times [2024-11-08 11:54:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847131993] [2024-11-08 11:54:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847131993] [2024-11-08 11:54:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847131993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550465083] [2024-11-08 11:54:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:39,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:54:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:54:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:54:39,082 INFO L87 Difference]: Start difference. First operand 557 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-08 11:54:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:39,787 INFO L93 Difference]: Finished difference Result 1704 states and 2582 transitions. [2024-11-08 11:54:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:54:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2024-11-08 11:54:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:39,793 INFO L225 Difference]: With dead ends: 1704 [2024-11-08 11:54:39,794 INFO L226 Difference]: Without dead ends: 1149 [2024-11-08 11:54:39,810 INFO L431 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 [2024-11-08 11:54:39,812 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 859 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:39,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1116 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:54:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-08 11:54:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 888. [2024-11-08 11:54:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5521628498727735) internal successors, (1220), 885 states have internal predecessors, (1220), 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) [2024-11-08 11:54:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1320 transitions. [2024-11-08 11:54:39,848 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1320 transitions. Word has length 21 [2024-11-08 11:54:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1320 transitions. [2024-11-08 11:54:39,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-08 11:54:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1320 transitions. [2024-11-08 11:54:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 11:54:39,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:39,849 INFO L215 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] [2024-11-08 11:54:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:54:39,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1086962958, now seen corresponding path program 1 times [2024-11-08 11:54:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516393229] [2024-11-08 11:54:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:40,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516393229] [2024-11-08 11:54:40,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516393229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001275295] [2024-11-08 11:54:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:40,042 INFO L87 Difference]: Start difference. First operand 888 states and 1320 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) [2024-11-08 11:54:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:40,075 INFO L93 Difference]: Finished difference Result 1774 states and 2638 transitions. [2024-11-08 11:54:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:40,076 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 [2024-11-08 11:54:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:40,080 INFO L225 Difference]: With dead ends: 1774 [2024-11-08 11:54:40,080 INFO L226 Difference]: Without dead ends: 888 [2024-11-08 11:54:40,082 INFO L431 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 [2024-11-08 11:54:40,083 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:40,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:54:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-08 11:54:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-08 11:54:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5508905852417303) internal successors, (1219), 885 states have internal predecessors, (1219), 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) [2024-11-08 11:54:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1319 transitions. [2024-11-08 11:54:40,106 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1319 transitions. Word has length 24 [2024-11-08 11:54:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:40,106 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1319 transitions. [2024-11-08 11:54:40,106 INFO L472 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) [2024-11-08 11:54:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1319 transitions. [2024-11-08 11:54:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 11:54:40,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:40,107 INFO L215 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] [2024-11-08 11:54:40,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:54:40,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1345128396, now seen corresponding path program 1 times [2024-11-08 11:54:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104569258] [2024-11-08 11:54:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104569258] [2024-11-08 11:54:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104569258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907780886] [2024-11-08 11:54:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:40,170 INFO L87 Difference]: Start difference. First operand 888 states and 1319 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) [2024-11-08 11:54:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:40,358 INFO L93 Difference]: Finished difference Result 2201 states and 3265 transitions. [2024-11-08 11:54:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:40,359 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 [2024-11-08 11:54:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:40,365 INFO L225 Difference]: With dead ends: 2201 [2024-11-08 11:54:40,365 INFO L226 Difference]: Without dead ends: 1315 [2024-11-08 11:54:40,369 INFO L431 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 [2024-11-08 11:54:40,369 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 533 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:40,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1382 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 11:54:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-08 11:54:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1231. [2024-11-08 11:54:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1129 states have (on average 1.5491585473870682) internal successors, (1749), 1228 states have internal predecessors, (1749), 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) [2024-11-08 11:54:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1849 transitions. [2024-11-08 11:54:40,401 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1849 transitions. Word has length 24 [2024-11-08 11:54:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1849 transitions. [2024-11-08 11:54:40,402 INFO L472 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) [2024-11-08 11:54:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1849 transitions. [2024-11-08 11:54:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 11:54:40,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:40,404 INFO L215 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] [2024-11-08 11:54:40,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:54:40,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 500156944, now seen corresponding path program 1 times [2024-11-08 11:54:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:40,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336503816] [2024-11-08 11:54:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336503816] [2024-11-08 11:54:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336503816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735695597] [2024-11-08 11:54:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:40,459 INFO L87 Difference]: Start difference. First operand 1231 states and 1849 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) [2024-11-08 11:54:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:41,006 INFO L93 Difference]: Finished difference Result 3169 states and 4832 transitions. [2024-11-08 11:54:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:41,006 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 [2024-11-08 11:54:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:41,014 INFO L225 Difference]: With dead ends: 3169 [2024-11-08 11:54:41,014 INFO L226 Difference]: Without dead ends: 1940 [2024-11-08 11:54:41,017 INFO L431 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 [2024-11-08 11:54:41,019 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 310 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:41,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 801 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:54:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-08 11:54:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1397. [2024-11-08 11:54:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1295 states have (on average 1.4517374517374517) internal successors, (1880), 1394 states have internal predecessors, (1880), 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) [2024-11-08 11:54:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1980 transitions. [2024-11-08 11:54:41,059 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1980 transitions. Word has length 24 [2024-11-08 11:54:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:41,059 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1980 transitions. [2024-11-08 11:54:41,060 INFO L472 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) [2024-11-08 11:54:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1980 transitions. [2024-11-08 11:54:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 11:54:41,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:41,060 INFO L215 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] [2024-11-08 11:54:41,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:54:41,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:41,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221522, now seen corresponding path program 1 times [2024-11-08 11:54:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910565715] [2024-11-08 11:54:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910565715] [2024-11-08 11:54:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910565715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:54:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269673672] [2024-11-08 11:54:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:41,108 INFO L87 Difference]: Start difference. First operand 1397 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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) [2024-11-08 11:54:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:41,231 INFO L93 Difference]: Finished difference Result 4140 states and 5880 transitions. [2024-11-08 11:54:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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 [2024-11-08 11:54:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:41,242 INFO L225 Difference]: With dead ends: 4140 [2024-11-08 11:54:41,242 INFO L226 Difference]: Without dead ends: 2745 [2024-11-08 11:54:41,245 INFO L431 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 [2024-11-08 11:54:41,246 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 510 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:41,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1073 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 11:54:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2024-11-08 11:54:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2657. [2024-11-08 11:54:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2555 states have (on average 1.4348336594911937) internal successors, (3666), 2654 states have internal predecessors, (3666), 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) [2024-11-08 11:54:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3766 transitions. [2024-11-08 11:54:41,306 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3766 transitions. Word has length 24 [2024-11-08 11:54:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:41,307 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 3766 transitions. [2024-11-08 11:54:41,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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) [2024-11-08 11:54:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3766 transitions. [2024-11-08 11:54:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 11:54:41,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:41,308 INFO L215 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] [2024-11-08 11:54:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:54:41,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1417555436, now seen corresponding path program 1 times [2024-11-08 11:54:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339466915] [2024-11-08 11:54:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339466915] [2024-11-08 11:54:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339466915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915654066] [2024-11-08 11:54:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:41,368 INFO L87 Difference]: Start difference. First operand 2657 states and 3766 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) [2024-11-08 11:54:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:41,973 INFO L93 Difference]: Finished difference Result 6143 states and 8908 transitions. [2024-11-08 11:54:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:41,974 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 [2024-11-08 11:54:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:41,987 INFO L225 Difference]: With dead ends: 6143 [2024-11-08 11:54:41,988 INFO L226 Difference]: Without dead ends: 3488 [2024-11-08 11:54:41,992 INFO L431 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 [2024-11-08 11:54:41,993 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 230 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:41,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 722 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:54:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2024-11-08 11:54:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3484. [2024-11-08 11:54:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3382 states have (on average 1.3746303962152573) internal successors, (4649), 3481 states have internal predecessors, (4649), 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) [2024-11-08 11:54:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4749 transitions. [2024-11-08 11:54:42,076 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4749 transitions. Word has length 25 [2024-11-08 11:54:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:42,077 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 4749 transitions. [2024-11-08 11:54:42,077 INFO L472 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) [2024-11-08 11:54:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4749 transitions. [2024-11-08 11:54:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 11:54:42,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:42,078 INFO L215 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] [2024-11-08 11:54:42,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:54:42,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:42,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2032440408, now seen corresponding path program 1 times [2024-11-08 11:54:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785580727] [2024-11-08 11:54:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785580727] [2024-11-08 11:54:42,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785580727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:42,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:42,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699963339] [2024-11-08 11:54:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:42,120 INFO L87 Difference]: Start difference. First operand 3484 states and 4749 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) [2024-11-08 11:54:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:42,727 INFO L93 Difference]: Finished difference Result 7813 states and 10890 transitions. [2024-11-08 11:54:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:42,728 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 [2024-11-08 11:54:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:42,742 INFO L225 Difference]: With dead ends: 7813 [2024-11-08 11:54:42,743 INFO L226 Difference]: Without dead ends: 4331 [2024-11-08 11:54:42,748 INFO L431 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 [2024-11-08 11:54:42,749 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:42,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 682 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:54:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2024-11-08 11:54:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4327. [2024-11-08 11:54:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 4225 states have (on average 1.353846153846154) internal successors, (5720), 4324 states have internal predecessors, (5720), 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) [2024-11-08 11:54:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5820 transitions. [2024-11-08 11:54:42,833 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5820 transitions. Word has length 25 [2024-11-08 11:54:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:42,833 INFO L471 AbstractCegarLoop]: Abstraction has 4327 states and 5820 transitions. [2024-11-08 11:54:42,833 INFO L472 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) [2024-11-08 11:54:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5820 transitions. [2024-11-08 11:54:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 11:54:42,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:42,835 INFO L215 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] [2024-11-08 11:54:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:54:42,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:42,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -995255721, now seen corresponding path program 1 times [2024-11-08 11:54:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115566614] [2024-11-08 11:54:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:42,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115566614] [2024-11-08 11:54:42,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115566614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:42,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:42,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:42,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943908689] [2024-11-08 11:54:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:42,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:42,878 INFO L87 Difference]: Start difference. First operand 4327 states and 5820 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-08 11:54:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:42,960 INFO L93 Difference]: Finished difference Result 8549 states and 11509 transitions. [2024-11-08 11:54:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2024-11-08 11:54:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:42,994 INFO L225 Difference]: With dead ends: 8549 [2024-11-08 11:54:42,994 INFO L226 Difference]: Without dead ends: 8542 [2024-11-08 11:54:42,999 INFO L431 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 [2024-11-08 11:54:43,001 INFO L432 NwaCegarLoop]: 1005 mSDtfsCounter, 548 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:43,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:54:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2024-11-08 11:54:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8441. [2024-11-08 11:54:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8339 states have (on average 1.3492025422712555) internal successors, (11251), 8438 states have internal predecessors, (11251), 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) [2024-11-08 11:54:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 11351 transitions. [2024-11-08 11:54:43,236 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 11351 transitions. Word has length 26 [2024-11-08 11:54:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:43,236 INFO L471 AbstractCegarLoop]: Abstraction has 8441 states and 11351 transitions. [2024-11-08 11:54:43,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-08 11:54:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 11351 transitions. [2024-11-08 11:54:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 11:54:43,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:43,237 INFO L215 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] [2024-11-08 11:54:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:54:43,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1419566957, now seen corresponding path program 1 times [2024-11-08 11:54:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073426907] [2024-11-08 11:54:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073426907] [2024-11-08 11:54:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073426907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:43,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:43,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:54:43,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204451782] [2024-11-08 11:54:43,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:43,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:43,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:43,277 INFO L87 Difference]: Start difference. First operand 8441 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) [2024-11-08 11:54:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:43,389 INFO L93 Difference]: Finished difference Result 16979 states and 22797 transitions. [2024-11-08 11:54:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 26 [2024-11-08 11:54:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:43,412 INFO L225 Difference]: With dead ends: 16979 [2024-11-08 11:54:43,412 INFO L226 Difference]: Without dead ends: 8540 [2024-11-08 11:54:43,425 INFO L431 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 [2024-11-08 11:54:43,426 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 533 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1209 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:54:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2024-11-08 11:54:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8439. [2024-11-08 11:54:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8439 states, 8339 states have (on average 1.3441659671423432) internal successors, (11209), 8436 states have internal predecessors, (11209), 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) [2024-11-08 11:54:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 11307 transitions. [2024-11-08 11:54:43,640 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 11307 transitions. Word has length 26 [2024-11-08 11:54:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 8439 states and 11307 transitions. [2024-11-08 11:54:43,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) [2024-11-08 11:54:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 11307 transitions. [2024-11-08 11:54:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 11:54:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:43,641 INFO L215 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] [2024-11-08 11:54:43,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:54:43,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1314457887, now seen corresponding path program 1 times [2024-11-08 11:54:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337654614] [2024-11-08 11:54:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337654614] [2024-11-08 11:54:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337654614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:54:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457473827] [2024-11-08 11:54:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:43,699 INFO L87 Difference]: Start difference. First operand 8439 states and 11307 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-11-08 11:54:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:43,843 INFO L93 Difference]: Finished difference Result 25142 states and 33722 transitions. [2024-11-08 11:54:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 28 [2024-11-08 11:54:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:43,879 INFO L225 Difference]: With dead ends: 25142 [2024-11-08 11:54:43,880 INFO L226 Difference]: Without dead ends: 16705 [2024-11-08 11:54:43,897 INFO L431 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 [2024-11-08 11:54:43,898 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 526 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:43,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:54:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2024-11-08 11:54:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16607. [2024-11-08 11:54:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16607 states, 16507 states have (on average 1.3390076937057007) internal successors, (22103), 16604 states have internal predecessors, (22103), 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) [2024-11-08 11:54:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16607 states to 16607 states and 22201 transitions. [2024-11-08 11:54:44,320 INFO L78 Accepts]: Start accepts. Automaton has 16607 states and 22201 transitions. Word has length 28 [2024-11-08 11:54:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 16607 states and 22201 transitions. [2024-11-08 11:54:44,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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) [2024-11-08 11:54:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16607 states and 22201 transitions. [2024-11-08 11:54:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 11:54:44,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:44,322 INFO L215 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] [2024-11-08 11:54:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:54:44,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:44,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1594983404, now seen corresponding path program 1 times [2024-11-08 11:54:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347835331] [2024-11-08 11:54:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347835331] [2024-11-08 11:54:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347835331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781670513] [2024-11-08 11:54:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:44,370 INFO L87 Difference]: Start difference. First operand 16607 states and 22201 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) [2024-11-08 11:54:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:44,718 INFO L93 Difference]: Finished difference Result 48238 states and 64732 transitions. [2024-11-08 11:54:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:44,719 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 [2024-11-08 11:54:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:44,784 INFO L225 Difference]: With dead ends: 48238 [2024-11-08 11:54:44,784 INFO L226 Difference]: Without dead ends: 31633 [2024-11-08 11:54:44,816 INFO L431 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 [2024-11-08 11:54:44,817 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 504 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:44,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1352 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:54:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31633 states. [2024-11-08 11:54:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31633 to 31544. [2024-11-08 11:54:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31544 states, 31444 states have (on average 1.3317644065640504) internal successors, (41876), 31541 states have internal predecessors, (41876), 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) [2024-11-08 11:54:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31544 states to 31544 states and 41974 transitions. [2024-11-08 11:54:45,580 INFO L78 Accepts]: Start accepts. Automaton has 31544 states and 41974 transitions. Word has length 33 [2024-11-08 11:54:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:45,581 INFO L471 AbstractCegarLoop]: Abstraction has 31544 states and 41974 transitions. [2024-11-08 11:54:45,581 INFO L472 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) [2024-11-08 11:54:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31544 states and 41974 transitions. [2024-11-08 11:54:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 11:54:45,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:45,582 INFO L215 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] [2024-11-08 11:54:45,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:54:45,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 132362279, now seen corresponding path program 1 times [2024-11-08 11:54:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054772579] [2024-11-08 11:54:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054772579] [2024-11-08 11:54:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054772579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387726490] [2024-11-08 11:54:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:45,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:45,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:45,635 INFO L87 Difference]: Start difference. First operand 31544 states and 41974 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2024-11-08 11:54:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:46,157 INFO L93 Difference]: Finished difference Result 73175 states and 97409 transitions. [2024-11-08 11:54:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2024-11-08 11:54:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:46,257 INFO L225 Difference]: With dead ends: 73175 [2024-11-08 11:54:46,257 INFO L226 Difference]: Without dead ends: 41633 [2024-11-08 11:54:46,306 INFO L431 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 [2024-11-08 11:54:46,307 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 483 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:46,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 965 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:54:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41633 states. [2024-11-08 11:54:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41633 to 41551. [2024-11-08 11:54:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41551 states, 41451 states have (on average 1.3153603049383609) internal successors, (54523), 41548 states have internal predecessors, (54523), 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) [2024-11-08 11:54:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41551 states to 41551 states and 54621 transitions. [2024-11-08 11:54:47,125 INFO L78 Accepts]: Start accepts. Automaton has 41551 states and 54621 transitions. Word has length 34 [2024-11-08 11:54:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:47,127 INFO L471 AbstractCegarLoop]: Abstraction has 41551 states and 54621 transitions. [2024-11-08 11:54:47,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2024-11-08 11:54:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 41551 states and 54621 transitions. [2024-11-08 11:54:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 11:54:47,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:47,127 INFO L215 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] [2024-11-08 11:54:47,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:54:47,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:47,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash -209128006, now seen corresponding path program 1 times [2024-11-08 11:54:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:47,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158160914] [2024-11-08 11:54:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158160914] [2024-11-08 11:54:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158160914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319121114] [2024-11-08 11:54:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:47,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:47,184 INFO L87 Difference]: Start difference. First operand 41551 states and 54621 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2024-11-08 11:54:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:48,026 INFO L93 Difference]: Finished difference Result 105458 states and 138388 transitions. [2024-11-08 11:54:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2024-11-08 11:54:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:48,181 INFO L225 Difference]: With dead ends: 105458 [2024-11-08 11:54:48,181 INFO L226 Difference]: Without dead ends: 63909 [2024-11-08 11:54:48,305 INFO L431 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 [2024-11-08 11:54:48,306 INFO L432 NwaCegarLoop]: 980 mSDtfsCounter, 440 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:48,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1445 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:54:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63909 states. [2024-11-08 11:54:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63909 to 59950. [2024-11-08 11:54:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59950 states, 59850 states have (on average 1.2822222222222222) internal successors, (76741), 59947 states have internal predecessors, (76741), 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) [2024-11-08 11:54:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 76839 transitions. [2024-11-08 11:54:49,217 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 76839 transitions. Word has length 40 [2024-11-08 11:54:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:49,217 INFO L471 AbstractCegarLoop]: Abstraction has 59950 states and 76839 transitions. [2024-11-08 11:54:49,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2024-11-08 11:54:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 76839 transitions. [2024-11-08 11:54:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 11:54:49,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:49,218 INFO L215 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] [2024-11-08 11:54:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:54:49,219 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1653138166, now seen corresponding path program 1 times [2024-11-08 11:54:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486846701] [2024-11-08 11:54:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486846701] [2024-11-08 11:54:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486846701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:54:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668847442] [2024-11-08 11:54:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:49,282 INFO L87 Difference]: Start difference. First operand 59950 states and 76839 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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) [2024-11-08 11:54:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:50,367 INFO L93 Difference]: Finished difference Result 157117 states and 202813 transitions. [2024-11-08 11:54:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 40 [2024-11-08 11:54:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:50,604 INFO L225 Difference]: With dead ends: 157117 [2024-11-08 11:54:50,605 INFO L226 Difference]: Without dead ends: 97169 [2024-11-08 11:54:50,638 INFO L431 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 [2024-11-08 11:54:50,639 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 450 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:50,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 984 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:54:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97169 states. [2024-11-08 11:54:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97169 to 97090. [2024-11-08 11:54:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97090 states, 96990 states have (on average 1.274615939787607) internal successors, (123625), 97087 states have internal predecessors, (123625), 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) [2024-11-08 11:54:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97090 states to 97090 states and 123723 transitions. [2024-11-08 11:54:52,014 INFO L78 Accepts]: Start accepts. Automaton has 97090 states and 123723 transitions. Word has length 40 [2024-11-08 11:54:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:52,014 INFO L471 AbstractCegarLoop]: Abstraction has 97090 states and 123723 transitions. [2024-11-08 11:54:52,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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) [2024-11-08 11:54:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 97090 states and 123723 transitions. [2024-11-08 11:54:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 11:54:52,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:52,016 INFO L215 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] [2024-11-08 11:54:52,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:54:52,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1240470838, now seen corresponding path program 1 times [2024-11-08 11:54:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14186559] [2024-11-08 11:54:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14186559] [2024-11-08 11:54:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14186559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911863801] [2024-11-08 11:54:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:54:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:52,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:54:52,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:54:52,109 INFO L87 Difference]: Start difference. First operand 97090 states and 123723 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-11-08 11:54:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:53,115 INFO L93 Difference]: Finished difference Result 174054 states and 221151 transitions. [2024-11-08 11:54:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:54:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 45 [2024-11-08 11:54:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:53,475 INFO L225 Difference]: With dead ends: 174054 [2024-11-08 11:54:53,476 INFO L226 Difference]: Without dead ends: 174051 [2024-11-08 11:54:53,540 INFO L431 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 [2024-11-08 11:54:53,540 INFO L432 NwaCegarLoop]: 1036 mSDtfsCounter, 527 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:53,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1576 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:54:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174051 states. [2024-11-08 11:54:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174051 to 173830. [2024-11-08 11:54:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173830 states, 173730 states have (on average 1.269723133598112) internal successors, (220589), 173827 states have internal predecessors, (220589), 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) [2024-11-08 11:54:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173830 states to 173830 states and 220687 transitions. [2024-11-08 11:54:56,291 INFO L78 Accepts]: Start accepts. Automaton has 173830 states and 220687 transitions. Word has length 45 [2024-11-08 11:54:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:54:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 173830 states and 220687 transitions. [2024-11-08 11:54:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-11-08 11:54:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 173830 states and 220687 transitions. [2024-11-08 11:54:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 11:54:56,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:54:56,293 INFO L215 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] [2024-11-08 11:54:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:54:56,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:54:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:54:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1976305641, now seen corresponding path program 1 times [2024-11-08 11:54:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:54:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71941223] [2024-11-08 11:54:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:54:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:54:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:54:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:54:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:54:56,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71941223] [2024-11-08 11:54:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71941223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:54:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:54:56,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:54:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954830765] [2024-11-08 11:54:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:54:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:54:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:54:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:54:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:54:56,376 INFO L87 Difference]: Start difference. First operand 173830 states and 220687 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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) [2024-11-08 11:54:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:54:58,796 INFO L93 Difference]: Finished difference Result 454683 states and 576582 transitions. [2024-11-08 11:54:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:54:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2024-11-08 11:54:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:54:59,839 INFO L225 Difference]: With dead ends: 454683 [2024-11-08 11:54:59,839 INFO L226 Difference]: Without dead ends: 280855 [2024-11-08 11:54:59,921 INFO L431 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 [2024-11-08 11:54:59,922 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 745 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:54:59,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 725 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:55:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280855 states. [2024-11-08 11:55:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280855 to 173825. [2024-11-08 11:55:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173825 states, 173730 states have (on average 1.2597075922408334) internal successors, (218849), 173822 states have internal predecessors, (218849), 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) [2024-11-08 11:55:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173825 states to 173825 states and 218942 transitions. [2024-11-08 11:55:02,698 INFO L78 Accepts]: Start accepts. Automaton has 173825 states and 218942 transitions. Word has length 48 [2024-11-08 11:55:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:02,699 INFO L471 AbstractCegarLoop]: Abstraction has 173825 states and 218942 transitions. [2024-11-08 11:55:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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) [2024-11-08 11:55:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 173825 states and 218942 transitions. [2024-11-08 11:55:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 11:55:02,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:02,700 INFO L215 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] [2024-11-08 11:55:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:55:02,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 951319779, now seen corresponding path program 1 times [2024-11-08 11:55:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276428472] [2024-11-08 11:55:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:55:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276428472] [2024-11-08 11:55:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276428472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083913087] [2024-11-08 11:55:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:02,758 INFO L87 Difference]: Start difference. First operand 173825 states and 218942 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-08 11:55:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:04,704 INFO L93 Difference]: Finished difference Result 343392 states and 432799 transitions. [2024-11-08 11:55:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 58 [2024-11-08 11:55:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:04,949 INFO L225 Difference]: With dead ends: 343392 [2024-11-08 11:55:04,949 INFO L226 Difference]: Without dead ends: 169569 [2024-11-08 11:55:05,061 INFO L431 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 [2024-11-08 11:55:05,061 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 389 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:05,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 361 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:55:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169569 states. [2024-11-08 11:55:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169569 to 89809. [2024-11-08 11:55:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89809 states, 89714 states have (on average 1.2017299418151013) internal successors, (107812), 89806 states have internal predecessors, (107812), 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) [2024-11-08 11:55:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89809 states to 89809 states and 107905 transitions. [2024-11-08 11:55:07,223 INFO L78 Accepts]: Start accepts. Automaton has 89809 states and 107905 transitions. Word has length 58 [2024-11-08 11:55:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:07,223 INFO L471 AbstractCegarLoop]: Abstraction has 89809 states and 107905 transitions. [2024-11-08 11:55:07,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-08 11:55:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 89809 states and 107905 transitions. [2024-11-08 11:55:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 11:55:07,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:07,224 INFO L215 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, 1] [2024-11-08 11:55:07,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:55:07,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:07,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1754865588, now seen corresponding path program 1 times [2024-11-08 11:55:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:07,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195689369] [2024-11-08 11:55:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:55:07,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:07,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195689369] [2024-11-08 11:55:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195689369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675274048] [2024-11-08 11:55:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:07,296 INFO L87 Difference]: Start difference. First operand 89809 states and 107905 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2024-11-08 11:55:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:07,798 INFO L93 Difference]: Finished difference Result 128298 states and 153371 transitions. [2024-11-08 11:55:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 113 [2024-11-08 11:55:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:07,980 INFO L225 Difference]: With dead ends: 128298 [2024-11-08 11:55:07,981 INFO L226 Difference]: Without dead ends: 128293 [2024-11-08 11:55:08,021 INFO L431 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 [2024-11-08 11:55:08,022 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 445 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:08,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1264 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 11:55:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128293 states. [2024-11-08 11:55:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128293 to 128079. [2024-11-08 11:55:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128079 states, 127984 states have (on average 1.1906722715339417) internal successors, (152387), 128076 states have internal predecessors, (152387), 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) [2024-11-08 11:55:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128079 states to 128079 states and 152480 transitions. [2024-11-08 11:55:10,333 INFO L78 Accepts]: Start accepts. Automaton has 128079 states and 152480 transitions. Word has length 113 [2024-11-08 11:55:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:10,333 INFO L471 AbstractCegarLoop]: Abstraction has 128079 states and 152480 transitions. [2024-11-08 11:55:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2024-11-08 11:55:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 128079 states and 152480 transitions. [2024-11-08 11:55:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 11:55:10,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:10,336 INFO L215 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, 1, 1] [2024-11-08 11:55:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:55:10,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 149557454, now seen corresponding path program 1 times [2024-11-08 11:55:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484555560] [2024-11-08 11:55:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 11:55:10,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:10,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484555560] [2024-11-08 11:55:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484555560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:10,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:10,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:10,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202054020] [2024-11-08 11:55:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:10,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:10,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:10,418 INFO L87 Difference]: Start difference. First operand 128079 states and 152480 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-08 11:55:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:11,987 INFO L93 Difference]: Finished difference Result 275491 states and 332198 transitions. [2024-11-08 11:55:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 [2024-11-08 11:55:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:12,240 INFO L225 Difference]: With dead ends: 275491 [2024-11-08 11:55:12,241 INFO L226 Difference]: Without dead ends: 147535 [2024-11-08 11:55:12,288 INFO L431 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 [2024-11-08 11:55:12,289 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:12,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 518 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:55:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147535 states. [2024-11-08 11:55:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147535 to 147227. [2024-11-08 11:55:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147227 states, 147132 states have (on average 1.1926773237636952) internal successors, (175481), 147224 states have internal predecessors, (175481), 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) [2024-11-08 11:55:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147227 states to 147227 states and 175574 transitions. [2024-11-08 11:55:13,927 INFO L78 Accepts]: Start accepts. Automaton has 147227 states and 175574 transitions. Word has length 144 [2024-11-08 11:55:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:13,928 INFO L471 AbstractCegarLoop]: Abstraction has 147227 states and 175574 transitions. [2024-11-08 11:55:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-08 11:55:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 147227 states and 175574 transitions. [2024-11-08 11:55:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 11:55:13,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:13,930 INFO L215 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, 1, 1] [2024-11-08 11:55:13,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:55:13,930 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1572407842, now seen corresponding path program 1 times [2024-11-08 11:55:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040749209] [2024-11-08 11:55:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 11:55:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040749209] [2024-11-08 11:55:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040749209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81515949] [2024-11-08 11:55:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:14,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:14,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:14,115 INFO L87 Difference]: Start difference. First operand 147227 states and 175574 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-08 11:55:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:16,842 INFO L93 Difference]: Finished difference Result 424126 states and 506087 transitions. [2024-11-08 11:55:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 146 [2024-11-08 11:55:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:17,201 INFO L225 Difference]: With dead ends: 424126 [2024-11-08 11:55:17,201 INFO L226 Difference]: Without dead ends: 277022 [2024-11-08 11:55:17,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:17,256 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 513 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:17,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 916 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:55:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277022 states. [2024-11-08 11:55:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277022 to 276834. [2024-11-08 11:55:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276834 states, 276739 states have (on average 1.1910030750996425) internal successors, (329597), 276831 states have internal predecessors, (329597), 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) [2024-11-08 11:55:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276834 states to 276834 states and 329690 transitions. [2024-11-08 11:55:21,402 INFO L78 Accepts]: Start accepts. Automaton has 276834 states and 329690 transitions. Word has length 146 [2024-11-08 11:55:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:21,402 INFO L471 AbstractCegarLoop]: Abstraction has 276834 states and 329690 transitions. [2024-11-08 11:55:21,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2024-11-08 11:55:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 276834 states and 329690 transitions. [2024-11-08 11:55:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 11:55:21,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:21,404 INFO L215 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, 1, 1] [2024-11-08 11:55:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:55:21,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:21,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -768181585, now seen corresponding path program 1 times [2024-11-08 11:55:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297985693] [2024-11-08 11:55:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:55:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297985693] [2024-11-08 11:55:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297985693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:55:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703075206] [2024-11-08 11:55:21,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:55:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:55:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:55:21,544 INFO L87 Difference]: Start difference. First operand 276834 states and 329690 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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)