./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 fca748b1 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-wip.dd.update-z3-fca748b-m [2024-11-19 18:45:55,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:45:55,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:45:55,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:45:55,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:45:55,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:45:55,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:45:55,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:45:55,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:45:55,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:45:55,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:45:55,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:45:55,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:45:55,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:45:55,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:45:55,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:45:55,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:45:55,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:45:55,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:45:55,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:45:55,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:45:55,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:45:55,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:45:55,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:45:55,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:45:55,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:45:55,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:45:55,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:45:55,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:45:55,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:45:55,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:45:55,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:45:55,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:45:55,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:45:55,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:45:55,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:45:55,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:45:55,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:45:55,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:45:55,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:45:55,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:45:55,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:45:55,400 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-11-19 18:45:55,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:45:55,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:45:55,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:45:55,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:45:55,702 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:45:55,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-19 18:45:57,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:45:57,501 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:45:57,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-19 18:45:57,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2146969ff/84941a9ceffb45fe87fcbf3f2e32597a/FLAGb05d4592c [2024-11-19 18:45:57,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2146969ff/84941a9ceffb45fe87fcbf3f2e32597a [2024-11-19 18:45:57,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:45:57,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:45:57,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:45:57,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:45:57,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:45:57,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:57" (1/1) ... [2024-11-19 18:45:57,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a73602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:57, skipping insertion in model container [2024-11-19 18:45:57,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:57" (1/1) ... [2024-11-19 18:45:57,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:45:57,944 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/Problem11.c[778,791] [2024-11-19 18:45:57,952 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/Problem11.c[817,830] [2024-11-19 18:45:58,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:45:58,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:45:58,813 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/Problem11.c[778,791] [2024-11-19 18:45:58,814 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/Problem11.c[817,830] [2024-11-19 18:45:58,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:45:59,015 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:45:59,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59 WrapperNode [2024-11-19 18:45:59,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:45:59,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:45:59,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:45:59,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:45:59,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,296 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1887 [2024-11-19 18:45:59,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:45:59,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:45:59,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:45:59,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:45:59,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,462 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-19 18:45:59,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:45:59,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:45:59,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:45:59,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:45:59,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (1/1) ... [2024-11-19 18:45:59,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:45:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:45:59,657 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-19 18:45:59,660 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-19 18:45:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:45:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-19 18:45:59,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-19 18:45:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-19 18:45:59,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-19 18:45:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:45:59,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:45:59,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:45:59,824 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:45:59,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:46:22,631 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-19 18:46:22,631 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:46:22,660 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:46:22,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:46:22,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:22 BoogieIcfgContainer [2024-11-19 18:46:22,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:46:22,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:46:22,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:46:22,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:46:22,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:45:57" (1/3) ... [2024-11-19 18:46:22,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c98b182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:22, skipping insertion in model container [2024-11-19 18:46:22,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:59" (2/3) ... [2024-11-19 18:46:22,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c98b182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:22, skipping insertion in model container [2024-11-19 18:46:22,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:22" (3/3) ... [2024-11-19 18:46:22,675 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11.c [2024-11-19 18:46:22,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:46:22,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 18:46:22,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:46:22,778 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;@41089418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:46:22,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 18:46:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 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-19 18:46:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 18:46:22,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:46:22,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:46:22,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:46:22,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:46:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -151746730, now seen corresponding path program 1 times [2024-11-19 18:46:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:46:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833580662] [2024-11-19 18:46:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:46:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:46:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:46:23,548 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-19 18:46:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:46:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833580662] [2024-11-19 18:46:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833580662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:46:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:46:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:46:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532719543] [2024-11-19 18:46:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:46:23,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:46:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:46:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:46:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:46:23,589 INFO L87 Difference]: Start difference. First operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 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.75) internal successors, (15), 3 states have internal predecessors, (15), 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-19 18:46:25,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:46:32,925 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-11-19 18:46:34,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:46:41,138 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-11-19 18:46:45,145 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-11-19 18:46:48,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:46:52,494 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-11-19 18:46:53,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:46:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:46:54,043 INFO L93 Difference]: Finished difference Result 1062 states and 1895 transitions. [2024-11-19 18:46:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:46:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-11-19 18:46:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:46:54,066 INFO L225 Difference]: With dead ends: 1062 [2024-11-19 18:46:54,066 INFO L226 Difference]: Without dead ends: 545 [2024-11-19 18:46:54,075 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-11-19 18:46:54,079 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 105 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:46:54,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 852 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1151 Invalid, 4 Unknown, 0 Unchecked, 30.3s Time] [2024-11-19 18:46:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-19 18:46:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 540. [2024-11-19 18:46:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 438 states have (on average 1.6164383561643836) internal successors, (708), 537 states have internal predecessors, (708), 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-19 18:46:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 808 transitions. [2024-11-19 18:46:54,146 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 808 transitions. Word has length 16 [2024-11-19 18:46:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:46:54,147 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 808 transitions. [2024-11-19 18:46:54,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-19 18:46:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 808 transitions. [2024-11-19 18:46:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 18:46:54,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:46:54,162 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-19 18:46:54,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:46:54,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:46:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:46:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1326248385, now seen corresponding path program 1 times [2024-11-19 18:46:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:46:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968071708] [2024-11-19 18:46:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:46:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:46:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:46:54,527 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-19 18:46:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:46:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968071708] [2024-11-19 18:46:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968071708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:46:54,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:46:54,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:46:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356242322] [2024-11-19 18:46:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:46:54,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:46:54,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:46:54,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:46:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:46:54,531 INFO L87 Difference]: Start difference. First operand 540 states and 808 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-19 18:46:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:46:54,592 INFO L93 Difference]: Finished difference Result 945 states and 1463 transitions. [2024-11-19 18:46:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:46:54,592 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-19 18:46:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:46:54,596 INFO L225 Difference]: With dead ends: 945 [2024-11-19 18:46:54,597 INFO L226 Difference]: Without dead ends: 541 [2024-11-19 18:46:54,599 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-19 18:46:54,601 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:46:54,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 18:46:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-19 18:46:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-19 18:46:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.6150341685649203) internal successors, (709), 538 states have internal predecessors, (709), 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-19 18:46:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2024-11-19 18:46:54,636 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 24 [2024-11-19 18:46:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:46:54,637 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2024-11-19 18:46:54,637 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-19 18:46:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2024-11-19 18:46:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 18:46:54,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:46:54,639 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-19 18:46:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:46:54,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:46:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:46:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2006306755, now seen corresponding path program 1 times [2024-11-19 18:46:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:46:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121881426] [2024-11-19 18:46:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:46:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:46:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:46:54,757 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-19 18:46:54,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:46:54,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121881426] [2024-11-19 18:46:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121881426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:46:54,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:46:54,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:46:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921875047] [2024-11-19 18:46:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:46:54,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:46:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:46:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:46:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:46:54,762 INFO L87 Difference]: Start difference. First operand 541 states and 809 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-19 18:46:59,209 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-11-19 18:47:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:00,250 INFO L93 Difference]: Finished difference Result 1324 states and 2074 transitions. [2024-11-19 18:47:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:00,251 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-19 18:47:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:00,256 INFO L225 Difference]: With dead ends: 1324 [2024-11-19 18:47:00,256 INFO L226 Difference]: Without dead ends: 919 [2024-11-19 18:47:00,257 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-19 18:47:00,259 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 580 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:00,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1254 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-19 18:47:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-19 18:47:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2024-11-19 18:47:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 721 states have (on average 1.6893203883495145) internal successors, (1218), 820 states have internal predecessors, (1218), 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-19 18:47:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1318 transitions. [2024-11-19 18:47:00,287 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1318 transitions. Word has length 24 [2024-11-19 18:47:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1318 transitions. [2024-11-19 18:47:00,288 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-19 18:47:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1318 transitions. [2024-11-19 18:47:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 18:47:00,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:00,292 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-19 18:47:00,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:47:00,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2065250464, now seen corresponding path program 1 times [2024-11-19 18:47:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544522912] [2024-11-19 18:47:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:00,385 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-19 18:47:00,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544522912] [2024-11-19 18:47:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544522912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249489971] [2024-11-19 18:47:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:00,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:00,390 INFO L87 Difference]: Start difference. First operand 823 states and 1318 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-11-19 18:47:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:00,801 INFO L93 Difference]: Finished difference Result 1502 states and 2465 transitions. [2024-11-19 18:47:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:00,802 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-11-19 18:47:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:00,812 INFO L225 Difference]: With dead ends: 1502 [2024-11-19 18:47:00,813 INFO L226 Difference]: Without dead ends: 1489 [2024-11-19 18:47:00,814 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-19 18:47:00,815 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 611 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:00,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1276 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:47:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-19 18:47:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1396. [2024-11-19 18:47:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1294 states have (on average 1.7349304482225656) internal successors, (2245), 1393 states have internal predecessors, (2245), 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-19 18:47:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2345 transitions. [2024-11-19 18:47:00,851 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2345 transitions. Word has length 25 [2024-11-19 18:47:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:00,852 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2345 transitions. [2024-11-19 18:47:00,852 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-11-19 18:47:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2345 transitions. [2024-11-19 18:47:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 18:47:00,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:00,854 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-19 18:47:00,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:47:00,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash -402454971, now seen corresponding path program 1 times [2024-11-19 18:47:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:00,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37484244] [2024-11-19 18:47:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:00,926 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-19 18:47:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37484244] [2024-11-19 18:47:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37484244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255726556] [2024-11-19 18:47:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:00,929 INFO L87 Difference]: Start difference. First operand 1396 states and 2345 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-19 18:47:08,547 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-11-19 18:47:12,559 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-11-19 18:47:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:12,803 INFO L93 Difference]: Finished difference Result 3819 states and 6580 transitions. [2024-11-19 18:47:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:12,804 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-19 18:47:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:12,815 INFO L225 Difference]: With dead ends: 3819 [2024-11-19 18:47:12,815 INFO L226 Difference]: Without dead ends: 2559 [2024-11-19 18:47:12,818 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-19 18:47:12,819 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 581 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:12,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1196 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2024-11-19 18:47:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2024-11-19 18:47:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2486. [2024-11-19 18:47:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2384 states have (on average 1.7638422818791946) internal successors, (4205), 2483 states have internal predecessors, (4205), 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-19 18:47:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4305 transitions. [2024-11-19 18:47:12,873 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4305 transitions. Word has length 26 [2024-11-19 18:47:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4305 transitions. [2024-11-19 18:47:12,874 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-19 18:47:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4305 transitions. [2024-11-19 18:47:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 18:47:12,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:12,878 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-19 18:47:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:47:12,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash -845354111, now seen corresponding path program 1 times [2024-11-19 18:47:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754698435] [2024-11-19 18:47:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:12,964 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-19 18:47:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754698435] [2024-11-19 18:47:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754698435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:47:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591816919] [2024-11-19 18:47:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:12,972 INFO L87 Difference]: Start difference. First operand 2486 states and 4305 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-19 18:47:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:13,036 INFO L93 Difference]: Finished difference Result 4820 states and 8421 transitions. [2024-11-19 18:47:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:13,037 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-19 18:47:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:13,055 INFO L225 Difference]: With dead ends: 4820 [2024-11-19 18:47:13,055 INFO L226 Difference]: Without dead ends: 4814 [2024-11-19 18:47:13,057 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-19 18:47:13,059 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 639 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:13,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 18:47:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2024-11-19 18:47:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4712. [2024-11-19 18:47:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4610 states have (on average 1.7806941431670282) internal successors, (8209), 4709 states have internal predecessors, (8209), 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-19 18:47:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 8309 transitions. [2024-11-19 18:47:13,182 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 8309 transitions. Word has length 26 [2024-11-19 18:47:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:13,184 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 8309 transitions. [2024-11-19 18:47:13,184 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-19 18:47:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 8309 transitions. [2024-11-19 18:47:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 18:47:13,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:13,186 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] [2024-11-19 18:47:13,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:47:13,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 408094664, now seen corresponding path program 1 times [2024-11-19 18:47:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149811606] [2024-11-19 18:47:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:13,267 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-19 18:47:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149811606] [2024-11-19 18:47:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149811606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766163092] [2024-11-19 18:47:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:13,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:13,270 INFO L87 Difference]: Start difference. First operand 4712 states and 8309 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:47:15,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:47:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:15,135 INFO L93 Difference]: Finished difference Result 13701 states and 24326 transitions. [2024-11-19 18:47:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 18:47:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:15,178 INFO L225 Difference]: With dead ends: 13701 [2024-11-19 18:47:15,179 INFO L226 Difference]: Without dead ends: 9125 [2024-11-19 18:47:15,190 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-19 18:47:15,192 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 603 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:15,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1323 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 18:47:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9125 states. [2024-11-19 18:47:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9125 to 9024. [2024-11-19 18:47:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9024 states, 8922 states have (on average 1.7831203765971755) internal successors, (15909), 9021 states have internal predecessors, (15909), 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-19 18:47:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 16009 transitions. [2024-11-19 18:47:15,467 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 16009 transitions. Word has length 27 [2024-11-19 18:47:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 9024 states and 16009 transitions. [2024-11-19 18:47:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:47:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 16009 transitions. [2024-11-19 18:47:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 18:47:15,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:15,469 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-11-19 18:47:15,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:47:15,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1314669293, now seen corresponding path program 1 times [2024-11-19 18:47:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052715865] [2024-11-19 18:47:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:15,550 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-19 18:47:15,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052715865] [2024-11-19 18:47:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052715865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180520608] [2024-11-19 18:47:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:15,553 INFO L87 Difference]: Start difference. First operand 9024 states and 16009 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) [2024-11-19 18:47:19,830 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-11-19 18:47:22,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:47:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:22,491 INFO L93 Difference]: Finished difference Result 26414 states and 47011 transitions. [2024-11-19 18:47:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:22,491 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 29 [2024-11-19 18:47:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:22,549 INFO L225 Difference]: With dead ends: 26414 [2024-11-19 18:47:22,549 INFO L226 Difference]: Without dead ends: 17526 [2024-11-19 18:47:22,568 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-19 18:47:22,569 INFO L432 NwaCegarLoop]: 723 mSDtfsCounter, 594 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:22,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1351 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2024-11-19 18:47:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17526 states. [2024-11-19 18:47:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17526 to 17424. [2024-11-19 18:47:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17322 states have (on average 1.7797598429742525) internal successors, (30829), 17421 states have internal predecessors, (30829), 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-19 18:47:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 30929 transitions. [2024-11-19 18:47:23,303 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 30929 transitions. Word has length 29 [2024-11-19 18:47:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:23,306 INFO L471 AbstractCegarLoop]: Abstraction has 17424 states and 30929 transitions. [2024-11-19 18:47:23,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-19 18:47:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 30929 transitions. [2024-11-19 18:47:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 18:47:23,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:23,311 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] [2024-11-19 18:47:23,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:47:23,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:23,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2099359570, now seen corresponding path program 1 times [2024-11-19 18:47:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518802843] [2024-11-19 18:47:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:23,546 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-19 18:47:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518802843] [2024-11-19 18:47:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518802843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848440281] [2024-11-19 18:47:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:23,550 INFO L87 Difference]: Start difference. First operand 17424 states and 30929 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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-19 18:47:24,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 18:47:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:47:25,018 INFO L93 Difference]: Finished difference Result 34712 states and 61702 transitions. [2024-11-19 18:47:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:47:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 30 [2024-11-19 18:47:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:47:25,187 INFO L225 Difference]: With dead ends: 34712 [2024-11-19 18:47:25,187 INFO L226 Difference]: Without dead ends: 34709 [2024-11-19 18:47:25,198 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-19 18:47:25,201 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 623 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:47:25,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1344 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 18:47:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2024-11-19 18:47:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34608. [2024-11-19 18:47:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34608 states, 34506 states have (on average 1.780472961224135) internal successors, (61437), 34605 states have internal predecessors, (61437), 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-19 18:47:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34608 states to 34608 states and 61537 transitions. [2024-11-19 18:47:26,410 INFO L78 Accepts]: Start accepts. Automaton has 34608 states and 61537 transitions. Word has length 30 [2024-11-19 18:47:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:47:26,413 INFO L471 AbstractCegarLoop]: Abstraction has 34608 states and 61537 transitions. [2024-11-19 18:47:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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-19 18:47:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34608 states and 61537 transitions. [2024-11-19 18:47:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 18:47:26,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:47:26,416 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] [2024-11-19 18:47:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:47:26,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:47:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:47:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 856506849, now seen corresponding path program 1 times [2024-11-19 18:47:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:47:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344333005] [2024-11-19 18:47:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:47:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:47:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:47:26,592 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-19 18:47:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:47:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344333005] [2024-11-19 18:47:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344333005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:47:26,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:47:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:47:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759133936] [2024-11-19 18:47:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:47:26,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:47:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:47:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:47:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:47:26,594 INFO L87 Difference]: Start difference. First operand 34608 states and 61537 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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)