./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.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 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:43:40,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:43:40,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:43:40,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:43:40,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:43:40,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:43:40,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:43:40,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:43:40,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:43:40,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:43:40,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:43:40,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:43:40,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:43:40,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:43:40,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:43:40,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:43:40,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:43:40,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:43:40,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:43:40,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:43:40,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:43:40,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:43:40,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:43:40,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:43:40,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:43:40,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:43:40,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:43:40,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:43:40,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:43:40,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:43:40,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:43:40,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:43:40,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:43:40,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:43:40,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:43:40,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:43:40,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:43:40,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:43:40,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:43:40,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:43:40,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:43:40,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:43:40,686 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 -> 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e [2024-10-12 16:43:40,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:43:40,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:43:40,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:43:40,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:43:40,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:43:40,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-10-12 16:43:42,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:43:42,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:43:42,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-10-12 16:43:42,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be630869/3c976e449ceb4f1f8f7438d9525233c9/FLAGaf165b9dc [2024-10-12 16:43:42,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be630869/3c976e449ceb4f1f8f7438d9525233c9 [2024-10-12 16:43:42,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:43:42,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:43:43,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:43:43,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:43:43,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:43:43,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:43:42" (1/1) ... [2024-10-12 16:43:43,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531d049d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:43, skipping insertion in model container [2024-10-12 16:43:43,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:43:42" (1/1) ... [2024-10-12 16:43:43,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:43:43,299 WARN L248 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/Problem11.c[778,791] [2024-10-12 16:43:43,308 WARN L248 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/Problem11.c[817,830] [2024-10-12 16:43:44,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:43:44,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:43:44,077 WARN L248 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/Problem11.c[778,791] [2024-10-12 16:43:44,077 WARN L248 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/Problem11.c[817,830] [2024-10-12 16:43:44,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:43:44,297 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:43:44,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44 WrapperNode [2024-10-12 16:43:44,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:43:44,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:43:44,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:43:44,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:43:44,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,565 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1877 [2024-10-12 16:43:44,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:43:44,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:43:44,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:43:44,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:43:44,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,764 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-10-12 16:43:44,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:43:44,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:43:44,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:43:44,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:43:44,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (1/1) ... [2024-10-12 16:43:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:43:44,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:43:44,953 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-10-12 16:43:44,959 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-10-12 16:43:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:43:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-10-12 16:43:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-10-12 16:43:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-10-12 16:43:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-10-12 16:43:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:43:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:43:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:43:45,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:43:45,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:44:12,272 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-12 16:44:12,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:44:12,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:44:12,322 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:44:12,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:44:12 BoogieIcfgContainer [2024-10-12 16:44:12,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:44:12,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:44:12,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:44:12,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:44:12,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:43:42" (1/3) ... [2024-10-12 16:44:12,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f720bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:44:12, skipping insertion in model container [2024-10-12 16:44:12,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:44" (2/3) ... [2024-10-12 16:44:12,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f720bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:44:12, skipping insertion in model container [2024-10-12 16:44:12,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:44:12" (3/3) ... [2024-10-12 16:44:12,332 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11.c [2024-10-12 16:44:12,348 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:44:12,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 16:44:12,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:44:12,428 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;@12cec80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:44:12,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 16:44:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 508 states, 403 states have (on average 1.6352357320099256) internal successors, (659), 405 states have internal predecessors, (659), 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-10-12 16:44:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 16:44:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:12,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:12,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -126402155, now seen corresponding path program 1 times [2024-10-12 16:44:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946459378] [2024-10-12 16:44:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946459378] [2024-10-12 16:44:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946459378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:13,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275447551] [2024-10-12 16:44:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:44:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:44:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:44:13,202 INFO L87 Difference]: Start difference. First operand has 508 states, 403 states have (on average 1.6352357320099256) internal successors, (659), 405 states have internal predecessors, (659), 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.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-12 16:44:16,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:26,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:28,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:32,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:36,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:38,197 INFO L93 Difference]: Finished difference Result 1053 states and 1886 transitions. [2024-10-12 16:44:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:44:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2024-10-12 16:44:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:38,216 INFO L225 Difference]: With dead ends: 1053 [2024-10-12 16:44:38,217 INFO L226 Difference]: Without dead ends: 542 [2024-10-12 16:44:38,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:44:38,226 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 141 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 105 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:38,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 838 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1160 Invalid, 2 Unknown, 0 Unchecked, 24.9s Time] [2024-10-12 16:44:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-12 16:44:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 537. [2024-10-12 16:44:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 435 states have (on average 1.6206896551724137) internal successors, (705), 534 states have internal predecessors, (705), 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-10-12 16:44:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 805 transitions. [2024-10-12 16:44:38,320 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 805 transitions. Word has length 15 [2024-10-12 16:44:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:38,321 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 805 transitions. [2024-10-12 16:44:38,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-12 16:44:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 805 transitions. [2024-10-12 16:44:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:44:38,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:38,323 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] [2024-10-12 16:44:38,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:44:38,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:38,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash -468910848, now seen corresponding path program 1 times [2024-10-12 16:44:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989762604] [2024-10-12 16:44:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989762604] [2024-10-12 16:44:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989762604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:38,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005070434] [2024-10-12 16:44:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:38,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:38,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:38,642 INFO L87 Difference]: Start difference. First operand 537 states and 805 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:39,531 INFO L93 Difference]: Finished difference Result 941 states and 1459 transitions. [2024-10-12 16:44:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 16:44:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:39,536 INFO L225 Difference]: With dead ends: 941 [2024-10-12 16:44:39,537 INFO L226 Difference]: Without dead ends: 538 [2024-10-12 16:44:39,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-12 16:44:39,539 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 0 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1295 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.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:39,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:44:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-12 16:44:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-10-12 16:44:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 436 states have (on average 1.6192660550458715) internal successors, (706), 535 states have internal predecessors, (706), 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-10-12 16:44:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 806 transitions. [2024-10-12 16:44:39,586 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 806 transitions. Word has length 23 [2024-10-12 16:44:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 806 transitions. [2024-10-12 16:44:39,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 806 transitions. [2024-10-12 16:44:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:44:39,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:39,588 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] [2024-10-12 16:44:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:44:39,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 211147522, now seen corresponding path program 1 times [2024-10-12 16:44:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:39,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615481254] [2024-10-12 16:44:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615481254] [2024-10-12 16:44:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615481254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:44:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608622394] [2024-10-12 16:44:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:39,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:39,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:39,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:39,679 INFO L87 Difference]: Start difference. First operand 538 states and 806 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:41,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:44,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:45,852 INFO L93 Difference]: Finished difference Result 1319 states and 2069 transitions. [2024-10-12 16:44:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 16:44:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:45,860 INFO L225 Difference]: With dead ends: 1319 [2024-10-12 16:44:45,860 INFO L226 Difference]: Without dead ends: 915 [2024-10-12 16:44:45,861 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-10-12 16:44:45,862 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 579 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:45,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1248 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-12 16:44:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-10-12 16:44:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 819. [2024-10-12 16:44:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 717 states have (on average 1.693165969316597) internal successors, (1214), 816 states have internal predecessors, (1214), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1314 transitions. [2024-10-12 16:44:45,894 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1314 transitions. Word has length 23 [2024-10-12 16:44:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:45,894 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1314 transitions. [2024-10-12 16:44:45,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1314 transitions. [2024-10-12 16:44:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 16:44:45,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:45,896 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-10-12 16:44:45,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:44:45,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2045078207, now seen corresponding path program 1 times [2024-10-12 16:44:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:45,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396739173] [2024-10-12 16:44:45,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396739173] [2024-10-12 16:44:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396739173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:44:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874385464] [2024-10-12 16:44:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:46,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:46,035 INFO L87 Difference]: Start difference. First operand 819 states and 1314 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-10-12 16:44:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:46,810 INFO L93 Difference]: Finished difference Result 1496 states and 2459 transitions. [2024-10-12 16:44:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:46,812 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-10-12 16:44:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:46,818 INFO L225 Difference]: With dead ends: 1496 [2024-10-12 16:44:46,819 INFO L226 Difference]: Without dead ends: 1483 [2024-10-12 16:44:46,821 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-10-12 16:44:46,822 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 610 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:46,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1270 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:44:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-12 16:44:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1390. [2024-10-12 16:44:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1288 states have (on average 1.7383540372670807) internal successors, (2239), 1387 states have internal predecessors, (2239), 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-10-12 16:44:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2339 transitions. [2024-10-12 16:44:46,871 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2339 transitions. Word has length 24 [2024-10-12 16:44:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:46,872 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2339 transitions. [2024-10-12 16:44:46,872 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-10-12 16:44:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2339 transitions. [2024-10-12 16:44:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:44:46,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:46,874 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-10-12 16:44:46,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:44:46,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1026375108, now seen corresponding path program 1 times [2024-10-12 16:44:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146129500] [2024-10-12 16:44:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:46,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146129500] [2024-10-12 16:44:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146129500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:46,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:44:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671174649] [2024-10-12 16:44:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:46,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:46,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:46,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:46,969 INFO L87 Difference]: Start difference. First operand 1390 states and 2339 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:49,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:51,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:54,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:44:59,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:45:03,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:45:06,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 16:45:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:45:06,815 INFO L93 Difference]: Finished difference Result 3805 states and 6566 transitions. [2024-10-12 16:45:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:45:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-12 16:45:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:45:06,828 INFO L225 Difference]: With dead ends: 3805 [2024-10-12 16:45:06,829 INFO L226 Difference]: Without dead ends: 2549 [2024-10-12 16:45:06,832 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-10-12 16:45:06,834 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 580 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:45:06,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1190 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 19.8s Time] [2024-10-12 16:45:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-10-12 16:45:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2476. [2024-10-12 16:45:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2374 states have (on average 1.7670598146588037) internal successors, (4195), 2473 states have internal predecessors, (4195), 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-10-12 16:45:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4295 transitions. [2024-10-12 16:45:06,897 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4295 transitions. Word has length 25 [2024-10-12 16:45:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:45:06,898 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4295 transitions. [2024-10-12 16:45:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:45:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4295 transitions. [2024-10-12 16:45:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:45:06,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:45:06,901 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-10-12 16:45:06,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:45:06,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:45:06,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:45:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash 583475968, now seen corresponding path program 1 times [2024-10-12 16:45:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:45:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695934472] [2024-10-12 16:45:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:45:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:45:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:45:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:45:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:45:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695934472] [2024-10-12 16:45:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695934472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:45:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:45:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:45:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074649729] [2024-10-12 16:45:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:45:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:45:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:45:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:45:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:45:06,995 INFO L87 Difference]: Start difference. First operand 2476 states and 4295 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-10-12 16:45:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:45:07,138 INFO L93 Difference]: Finished difference Result 4802 states and 8403 transitions. [2024-10-12 16:45:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:45:07,139 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-10-12 16:45:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:45:07,157 INFO L225 Difference]: With dead ends: 4802 [2024-10-12 16:45:07,158 INFO L226 Difference]: Without dead ends: 4796 [2024-10-12 16:45:07,161 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-10-12 16:45:07,162 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 637 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:45:07,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1291 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 16:45:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-10-12 16:45:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 4694. [2024-10-12 16:45:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4694 states, 4592 states have (on average 1.783754355400697) internal successors, (8191), 4691 states have internal predecessors, (8191), 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-10-12 16:45:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 8291 transitions. [2024-10-12 16:45:07,259 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 8291 transitions. Word has length 25 [2024-10-12 16:45:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:45:07,260 INFO L471 AbstractCegarLoop]: Abstraction has 4694 states and 8291 transitions. [2024-10-12 16:45:07,260 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-10-12 16:45:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 8291 transitions. [2024-10-12 16:45:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 16:45:07,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:45:07,261 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-10-12 16:45:07,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:45:07,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:45:07,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:45:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1752154153, now seen corresponding path program 1 times [2024-10-12 16:45:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:45:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488406762] [2024-10-12 16:45:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:45:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:45:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:45:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:45:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:45:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488406762] [2024-10-12 16:45:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488406762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:45:07,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:45:07,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:45:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204480942] [2024-10-12 16:45:07,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:45:07,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:45:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:45:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:45:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:45:07,376 INFO L87 Difference]: Start difference. First operand 4694 states and 8291 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-10-12 16:45:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:45:08,432 INFO L93 Difference]: Finished difference Result 13651 states and 24276 transitions. [2024-10-12 16:45:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:45:08,435 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-10-12 16:45:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:45:08,470 INFO L225 Difference]: With dead ends: 13651 [2024-10-12 16:45:08,470 INFO L226 Difference]: Without dead ends: 9091 [2024-10-12 16:45:08,480 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-10-12 16:45:08,480 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 602 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:45:08,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1317 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:45:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2024-10-12 16:45:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 8990. [2024-10-12 16:45:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8990 states, 8888 states have (on average 1.786116111611161) internal successors, (15875), 8987 states have internal predecessors, (15875), 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-10-12 16:45:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 15975 transitions. [2024-10-12 16:45:08,679 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 15975 transitions. Word has length 26 [2024-10-12 16:45:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:45:08,680 INFO L471 AbstractCegarLoop]: Abstraction has 8990 states and 15975 transitions. [2024-10-12 16:45:08,680 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-10-12 16:45:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 15975 transitions. [2024-10-12 16:45:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 16:45:08,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:45:08,682 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-10-12 16:45:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:45:08,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:45:08,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:45:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash 170682126, now seen corresponding path program 1 times [2024-10-12 16:45:08,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:45:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539342350] [2024-10-12 16:45:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:45:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:45:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:45:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:45:08,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:45:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539342350] [2024-10-12 16:45:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539342350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:45:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:45:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:45:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014647266] [2024-10-12 16:45:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:45:08,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:45:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:45:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:45:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:45:08,767 INFO L87 Difference]: Start difference. First operand 8990 states and 15975 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-10-12 16:45:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:45:10,919 INFO L93 Difference]: Finished difference Result 26316 states and 46913 transitions. [2024-10-12 16:45:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:45:10,920 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-10-12 16:45:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:45:10,978 INFO L225 Difference]: With dead ends: 26316 [2024-10-12 16:45:10,978 INFO L226 Difference]: Without dead ends: 17460 [2024-10-12 16:45:10,996 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-10-12 16:45:10,997 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 593 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:45:10,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1345 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:45:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17460 states. [2024-10-12 16:45:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17460 to 17358. [2024-10-12 16:45:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17358 states, 17256 states have (on average 1.7827422345850719) internal successors, (30763), 17355 states have internal predecessors, (30763), 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-10-12 16:45:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17358 states to 17358 states and 30863 transitions. [2024-10-12 16:45:11,376 INFO L78 Accepts]: Start accepts. Automaton has 17358 states and 30863 transitions. Word has length 28 [2024-10-12 16:45:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:45:11,376 INFO L471 AbstractCegarLoop]: Abstraction has 17358 states and 30863 transitions. [2024-10-12 16:45:11,377 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-10-12 16:45:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17358 states and 30863 transitions. [2024-10-12 16:45:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 16:45:11,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:45:11,378 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] [2024-10-12 16:45:11,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:45:11,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:45:11,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:45:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 995495761, now seen corresponding path program 1 times [2024-10-12 16:45:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:45:11,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064814243] [2024-10-12 16:45:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:45:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:45:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:45:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:45:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:45:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064814243] [2024-10-12 16:45:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064814243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:45:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:45:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:45:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019462330] [2024-10-12 16:45:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:45:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:45:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:45:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:45:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:45:11,457 INFO L87 Difference]: Start difference. First operand 17358 states and 30863 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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)