./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label04.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 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:10:04,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:10:04,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:10:04,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:10:04,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:10:04,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:10:04,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:10:04,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:10:04,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:10:04,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:10:04,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:10:04,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:10:04,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:10:04,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:10:04,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:10:04,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:10:04,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:10:04,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:10:04,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:10:04,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:10:04,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:10:04,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:10:04,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:10:04,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:10:04,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:10:04,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:10:04,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:10:04,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:10:04,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:10:04,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:10:04,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:10:04,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:10:04,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:04,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:10:04,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:10:04,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:10:04,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:10:04,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:10:04,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:10:04,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:10:04,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:10:04,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:10:04,567 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 -> 1108eeb4bd20019b014e3c74d7da568cbd9d144764ba0dc8eabd0c3ee1f98907 [2024-11-08 11:10:04,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:10:04,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:10:04,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:10:04,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:10:04,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:10:04,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-11-08 11:10:06,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:10:06,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:10:06,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label04.c [2024-11-08 11:10:06,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f18a50988/cb8833218dc14917adc062e6dd2fa9d3/FLAG36754a9ec [2024-11-08 11:10:06,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f18a50988/cb8833218dc14917adc062e6dd2fa9d3 [2024-11-08 11:10:06,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:10:06,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:10:06,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:06,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:10:06,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:10:06,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:06" (1/1) ... [2024-11-08 11:10:06,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fdb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:06, skipping insertion in model container [2024-11-08 11:10:06,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:06" (1/1) ... [2024-11-08 11:10:06,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:10:07,201 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-rers2012/Problem11_label04.c[7746,7759] [2024-11-08 11:10:07,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:07,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:10:07,458 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-rers2012/Problem11_label04.c[7746,7759] [2024-11-08 11:10:07,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:07,577 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:10:07,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07 WrapperNode [2024-11-08 11:10:07,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:07,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:07,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:10:07,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:10:07,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,696 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:10:07,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:07,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:10:07,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:10:07,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:10:07,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,777 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:10:07,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:10:07,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:10:07,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:10:07,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:10:07,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:07,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:10:07,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:10:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:10:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:10:07,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:10:07,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:10:08,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:10:08,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:10:09,618 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:10:09,618 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:10:09,644 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:10:09,646 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:10:09,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09 BoogieIcfgContainer [2024-11-08 11:10:09,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:10:09,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:10:09,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:10:09,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:10:09,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:06" (1/3) ... [2024-11-08 11:10:09,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35130588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:09, skipping insertion in model container [2024-11-08 11:10:09,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (2/3) ... [2024-11-08 11:10:09,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35130588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:09, skipping insertion in model container [2024-11-08 11:10:09,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09" (3/3) ... [2024-11-08 11:10:09,658 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label04.c [2024-11-08 11:10:09,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:10:09,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:10:09,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:10:09,764 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;@11986d87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:10:09,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:10:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 11:10:09,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:09,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:09,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:09,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2024-11-08 11:10:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502565017] [2024-11-08 11:10:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502565017] [2024-11-08 11:10:10,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502565017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114974496] [2024-11-08 11:10:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:10,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:10,265 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:11,367 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-08 11:10:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 11:10:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:11,381 INFO L225 Difference]: With dead ends: 763 [2024-11-08 11:10:11,382 INFO L226 Difference]: Without dead ends: 416 [2024-11-08 11:10:11,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:11,388 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 220 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:11,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:10:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-08 11:10:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-08 11:10:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-08 11:10:11,451 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 53 [2024-11-08 11:10:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-08 11:10:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-08 11:10:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 11:10:11,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:11,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:10:11,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1781773818, now seen corresponding path program 1 times [2024-11-08 11:10:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492055952] [2024-11-08 11:10:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492055952] [2024-11-08 11:10:11,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492055952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:11,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514798279] [2024-11-08 11:10:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:11,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:11,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:11,690 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:12,377 INFO L93 Difference]: Finished difference Result 1191 states and 1930 transitions. [2024-11-08 11:10:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-08 11:10:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:12,382 INFO L225 Difference]: With dead ends: 1191 [2024-11-08 11:10:12,382 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 11:10:12,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:12,385 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:12,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 152 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 11:10:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2024-11-08 11:10:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.438618925831202) internal successors, (1125), 782 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1125 transitions. [2024-11-08 11:10:12,439 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1125 transitions. Word has length 118 [2024-11-08 11:10:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:12,441 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1125 transitions. [2024-11-08 11:10:12,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1125 transitions. [2024-11-08 11:10:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 11:10:12,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:12,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:12,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:10:12,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:12,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1565859760, now seen corresponding path program 1 times [2024-11-08 11:10:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992606712] [2024-11-08 11:10:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992606712] [2024-11-08 11:10:12,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992606712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:12,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:12,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:12,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352137682] [2024-11-08 11:10:12,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:12,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:12,652 INFO L87 Difference]: Start difference. First operand 783 states and 1125 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:13,392 INFO L93 Difference]: Finished difference Result 1948 states and 2801 transitions. [2024-11-08 11:10:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-08 11:10:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:13,397 INFO L225 Difference]: With dead ends: 1948 [2024-11-08 11:10:13,397 INFO L226 Difference]: Without dead ends: 1167 [2024-11-08 11:10:13,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,399 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:13,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-08 11:10:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-08 11:10:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3391153512575888) internal successors, (1544), 1153 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1544 transitions. [2024-11-08 11:10:13,422 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1544 transitions. Word has length 121 [2024-11-08 11:10:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1544 transitions. [2024-11-08 11:10:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1544 transitions. [2024-11-08 11:10:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 11:10:13,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:13,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:13,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:10:13,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 234761808, now seen corresponding path program 1 times [2024-11-08 11:10:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559062223] [2024-11-08 11:10:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559062223] [2024-11-08 11:10:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559062223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032683451] [2024-11-08 11:10:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,826 INFO L87 Difference]: Start difference. First operand 1154 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:14,507 INFO L93 Difference]: Finished difference Result 2676 states and 3529 transitions. [2024-11-08 11:10:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-08 11:10:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:14,513 INFO L225 Difference]: With dead ends: 2676 [2024-11-08 11:10:14,514 INFO L226 Difference]: Without dead ends: 1524 [2024-11-08 11:10:14,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:14,516 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:14,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-08 11:10:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-08 11:10:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.268725361366623) internal successors, (1931), 1522 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1931 transitions. [2024-11-08 11:10:14,543 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1931 transitions. Word has length 122 [2024-11-08 11:10:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:14,544 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1931 transitions. [2024-11-08 11:10:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1931 transitions. [2024-11-08 11:10:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 11:10:14,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:14,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:14,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:10:14,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1699725549, now seen corresponding path program 1 times [2024-11-08 11:10:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48523044] [2024-11-08 11:10:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48523044] [2024-11-08 11:10:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48523044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654472637] [2024-11-08 11:10:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:14,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:14,752 INFO L87 Difference]: Start difference. First operand 1523 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:15,484 INFO L93 Difference]: Finished difference Result 3968 states and 5151 transitions. [2024-11-08 11:10:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-11-08 11:10:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:15,492 INFO L225 Difference]: With dead ends: 3968 [2024-11-08 11:10:15,492 INFO L226 Difference]: Without dead ends: 2631 [2024-11-08 11:10:15,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:15,496 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:15,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-08 11:10:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2447. [2024-11-08 11:10:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.2236304170073589) internal successors, (2993), 2446 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 2993 transitions. [2024-11-08 11:10:15,537 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 2993 transitions. Word has length 180 [2024-11-08 11:10:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 2993 transitions. [2024-11-08 11:10:15,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2993 transitions. [2024-11-08 11:10:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 11:10:15,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:15,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:10:15,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1613150643, now seen corresponding path program 1 times [2024-11-08 11:10:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20848902] [2024-11-08 11:10:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 11:10:15,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20848902] [2024-11-08 11:10:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20848902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215857969] [2024-11-08 11:10:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:15,829 INFO L87 Difference]: Start difference. First operand 2447 states and 2993 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:16,435 INFO L93 Difference]: Finished difference Result 5266 states and 6463 transitions. [2024-11-08 11:10:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-08 11:10:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:16,446 INFO L225 Difference]: With dead ends: 5266 [2024-11-08 11:10:16,446 INFO L226 Difference]: Without dead ends: 3005 [2024-11-08 11:10:16,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:16,451 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:16,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2024-11-08 11:10:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2820. [2024-11-08 11:10:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2819 states have (on average 1.2220645619013835) internal successors, (3445), 2819 states have internal predecessors, (3445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3445 transitions. [2024-11-08 11:10:16,502 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3445 transitions. Word has length 196 [2024-11-08 11:10:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:16,503 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3445 transitions. [2024-11-08 11:10:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3445 transitions. [2024-11-08 11:10:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 11:10:16,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:16,507 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:10:16,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -58400973, now seen corresponding path program 1 times [2024-11-08 11:10:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618519406] [2024-11-08 11:10:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618519406] [2024-11-08 11:10:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618519406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:16,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992698959] [2024-11-08 11:10:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:16,806 INFO L87 Difference]: Start difference. First operand 2820 states and 3445 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:17,544 INFO L93 Difference]: Finished difference Result 6567 states and 8101 transitions. [2024-11-08 11:10:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-11-08 11:10:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:17,559 INFO L225 Difference]: With dead ends: 6567 [2024-11-08 11:10:17,559 INFO L226 Difference]: Without dead ends: 3933 [2024-11-08 11:10:17,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:17,564 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:17,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-11-08 11:10:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3556. [2024-11-08 11:10:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 3555 states have (on average 1.2115330520393812) internal successors, (4307), 3555 states have internal predecessors, (4307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4307 transitions. [2024-11-08 11:10:17,626 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4307 transitions. Word has length 233 [2024-11-08 11:10:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:17,627 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4307 transitions. [2024-11-08 11:10:17,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4307 transitions. [2024-11-08 11:10:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 11:10:17,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:17,630 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:17,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:10:17,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1422286637, now seen corresponding path program 1 times [2024-11-08 11:10:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730326677] [2024-11-08 11:10:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:10:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730326677] [2024-11-08 11:10:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730326677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313564877] [2024-11-08 11:10:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:17,955 INFO L87 Difference]: Start difference. First operand 3556 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:18,758 INFO L93 Difference]: Finished difference Result 9319 states and 11375 transitions. [2024-11-08 11:10:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:18,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-11-08 11:10:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:18,775 INFO L225 Difference]: With dead ends: 9319 [2024-11-08 11:10:18,775 INFO L226 Difference]: Without dead ends: 5765 [2024-11-08 11:10:18,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:18,782 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 179 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:18,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 140 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2024-11-08 11:10:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 4844. [2024-11-08 11:10:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4844 states, 4843 states have (on average 1.207309518893248) internal successors, (5847), 4843 states have internal predecessors, (5847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 5847 transitions. [2024-11-08 11:10:18,893 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 5847 transitions. Word has length 234 [2024-11-08 11:10:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 4844 states and 5847 transitions. [2024-11-08 11:10:18,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 5847 transitions. [2024-11-08 11:10:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-08 11:10:18,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:18,901 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:10:18,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:18,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1578805231, now seen corresponding path program 1 times [2024-11-08 11:10:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151425583] [2024-11-08 11:10:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:10:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151425583] [2024-11-08 11:10:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151425583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886822635] [2024-11-08 11:10:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:19,111 INFO L87 Difference]: Start difference. First operand 4844 states and 5847 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:19,833 INFO L93 Difference]: Finished difference Result 9684 states and 11690 transitions. [2024-11-08 11:10:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2024-11-08 11:10:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:19,850 INFO L225 Difference]: With dead ends: 9684 [2024-11-08 11:10:19,850 INFO L226 Difference]: Without dead ends: 4842 [2024-11-08 11:10:19,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:19,858 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:19,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 304 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2024-11-08 11:10:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4658. [2024-11-08 11:10:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4657 states have (on average 1.1541765084818554) internal successors, (5375), 4657 states have internal predecessors, (5375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 5375 transitions. [2024-11-08 11:10:19,962 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 5375 transitions. Word has length 314 [2024-11-08 11:10:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 4658 states and 5375 transitions. [2024-11-08 11:10:19,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 5375 transitions. [2024-11-08 11:10:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-08 11:10:19,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:19,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:10:19,974 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 228686210, now seen corresponding path program 1 times [2024-11-08 11:10:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347280646] [2024-11-08 11:10:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:10:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347280646] [2024-11-08 11:10:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347280646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:20,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:20,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425311407] [2024-11-08 11:10:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:20,264 INFO L87 Difference]: Start difference. First operand 4658 states and 5375 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:20,667 INFO L93 Difference]: Finished difference Result 9310 states and 10744 transitions. [2024-11-08 11:10:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2024-11-08 11:10:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:20,690 INFO L225 Difference]: With dead ends: 9310 [2024-11-08 11:10:20,693 INFO L226 Difference]: Without dead ends: 4654 [2024-11-08 11:10:20,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:20,702 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:20,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:10:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2024-11-08 11:10:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4654. [2024-11-08 11:10:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4653 states have (on average 1.1532344723834085) internal successors, (5366), 4653 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 5366 transitions. [2024-11-08 11:10:20,831 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 5366 transitions. Word has length 335 [2024-11-08 11:10:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:20,831 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 5366 transitions. [2024-11-08 11:10:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 5366 transitions. [2024-11-08 11:10:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 11:10:20,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:20,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:10:20,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1912311325, now seen corresponding path program 1 times [2024-11-08 11:10:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575050711] [2024-11-08 11:10:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 11:10:21,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:21,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575050711] [2024-11-08 11:10:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575050711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:21,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:21,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322883663] [2024-11-08 11:10:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:21,082 INFO L87 Difference]: Start difference. First operand 4654 states and 5366 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:21,893 INFO L93 Difference]: Finished difference Result 10412 states and 12095 transitions. [2024-11-08 11:10:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2024-11-08 11:10:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:21,903 INFO L225 Difference]: With dead ends: 10412 [2024-11-08 11:10:21,904 INFO L226 Difference]: Without dead ends: 5760 [2024-11-08 11:10:21,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:21,910 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 142 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:21,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 365 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2024-11-08 11:10:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5205. [2024-11-08 11:10:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5205 states, 5204 states have (on average 1.1391237509607994) internal successors, (5928), 5204 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 5928 transitions. [2024-11-08 11:10:22,007 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 5928 transitions. Word has length 336 [2024-11-08 11:10:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:22,007 INFO L471 AbstractCegarLoop]: Abstraction has 5205 states and 5928 transitions. [2024-11-08 11:10:22,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 5928 transitions. [2024-11-08 11:10:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-11-08 11:10:22,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:22,018 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:10:22,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1289979440, now seen corresponding path program 1 times [2024-11-08 11:10:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073676416] [2024-11-08 11:10:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:10:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:22,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073676416] [2024-11-08 11:10:22,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073676416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:22,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:22,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873845225] [2024-11-08 11:10:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:22,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:22,330 INFO L87 Difference]: Start difference. First operand 5205 states and 5928 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:23,459 INFO L93 Difference]: Finished difference Result 14288 states and 16265 transitions. [2024-11-08 11:10:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2024-11-08 11:10:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:23,475 INFO L225 Difference]: With dead ends: 14288 [2024-11-08 11:10:23,475 INFO L226 Difference]: Without dead ends: 9085 [2024-11-08 11:10:23,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:23,482 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 192 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:23,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 70 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:10:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-11-08 11:10:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8897. [2024-11-08 11:10:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8897 states, 8896 states have (on average 1.1289343525179856) internal successors, (10043), 8896 states have internal predecessors, (10043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 10043 transitions. [2024-11-08 11:10:23,596 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 10043 transitions. Word has length 390 [2024-11-08 11:10:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:23,596 INFO L471 AbstractCegarLoop]: Abstraction has 8897 states and 10043 transitions. [2024-11-08 11:10:23,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 10043 transitions. [2024-11-08 11:10:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-11-08 11:10:23,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:23,613 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:23,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:10:23,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:23,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1246889041, now seen corresponding path program 1 times [2024-11-08 11:10:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147942712] [2024-11-08 11:10:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 11:10:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:24,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147942712] [2024-11-08 11:10:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147942712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367315077] [2024-11-08 11:10:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:24,030 INFO L87 Difference]: Start difference. First operand 8897 states and 10043 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:24,710 INFO L93 Difference]: Finished difference Result 17419 states and 19680 transitions. [2024-11-08 11:10:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2024-11-08 11:10:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:24,724 INFO L225 Difference]: With dead ends: 17419 [2024-11-08 11:10:24,724 INFO L226 Difference]: Without dead ends: 8894 [2024-11-08 11:10:24,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:24,733 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:24,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 353 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8894 states. [2024-11-08 11:10:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 8710. [2024-11-08 11:10:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8710 states, 8709 states have (on average 1.112067975657366) internal successors, (9685), 8709 states have internal predecessors, (9685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 9685 transitions. [2024-11-08 11:10:24,833 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 9685 transitions. Word has length 457 [2024-11-08 11:10:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:24,834 INFO L471 AbstractCegarLoop]: Abstraction has 8710 states and 9685 transitions. [2024-11-08 11:10:24,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 9685 transitions. [2024-11-08 11:10:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-08 11:10:24,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:24,854 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:24,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:10:24,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1286763601, now seen corresponding path program 1 times [2024-11-08 11:10:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:24,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546652859] [2024-11-08 11:10:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-08 11:10:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546652859] [2024-11-08 11:10:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546652859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270482828] [2024-11-08 11:10:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:25,468 INFO L87 Difference]: Start difference. First operand 8710 states and 9685 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:26,216 INFO L93 Difference]: Finished difference Result 18707 states and 20955 transitions. [2024-11-08 11:10:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2024-11-08 11:10:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:26,231 INFO L225 Difference]: With dead ends: 18707 [2024-11-08 11:10:26,231 INFO L226 Difference]: Without dead ends: 10367 [2024-11-08 11:10:26,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:26,240 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:26,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 146 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10367 states. [2024-11-08 11:10:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10367 to 8518. [2024-11-08 11:10:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8518 states, 8517 states have (on average 1.1141246917928849) internal successors, (9489), 8517 states have internal predecessors, (9489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 9489 transitions. [2024-11-08 11:10:26,342 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 9489 transitions. Word has length 525 [2024-11-08 11:10:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:26,343 INFO L471 AbstractCegarLoop]: Abstraction has 8518 states and 9489 transitions. [2024-11-08 11:10:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 9489 transitions. [2024-11-08 11:10:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2024-11-08 11:10:26,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:26,367 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:26,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:10:26,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1613412214, now seen corresponding path program 1 times [2024-11-08 11:10:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031994734] [2024-11-08 11:10:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-11-08 11:10:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031994734] [2024-11-08 11:10:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031994734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363499462] [2024-11-08 11:10:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:26,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:26,849 INFO L87 Difference]: Start difference. First operand 8518 states and 9489 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:27,438 INFO L93 Difference]: Finished difference Result 17581 states and 19584 transitions. [2024-11-08 11:10:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:27,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 629 [2024-11-08 11:10:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:27,439 INFO L225 Difference]: With dead ends: 17581 [2024-11-08 11:10:27,440 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:10:27,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:27,455 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 116 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:27,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 319 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:10:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:10:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:10:27,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 629 [2024-11-08 11:10:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:27,457 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:10:27,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:10:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:10:27,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:10:27,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:10:27,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:27,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:10:28,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:10:28,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:10:28 BoogieIcfgContainer [2024-11-08 11:10:28,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:10:28,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:10:28,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:10:28,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:10:28,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09" (3/4) ... [2024-11-08 11:10:28,690 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:10:28,709 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:10:28,710 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:10:28,711 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:10:28,713 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:10:28,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:10:28,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:10:28,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:10:28,876 INFO L158 Benchmark]: Toolchain (without parser) took 22018.35ms. Allocated memory was 161.5MB in the beginning and 719.3MB in the end (delta: 557.8MB). Free memory was 86.5MB in the beginning and 421.5MB in the end (delta: -335.0MB). Peak memory consumption was 225.1MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,876 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:10:28,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.20ms. Allocated memory is still 161.5MB. Free memory was 86.3MB in the beginning and 98.2MB in the end (delta: -11.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.23ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 80.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,878 INFO L158 Benchmark]: Boogie Preprocessor took 189.90ms. Allocated memory is still 161.5MB. Free memory was 80.5MB in the beginning and 55.1MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,878 INFO L158 Benchmark]: RCFGBuilder took 1758.53ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 55.1MB in the beginning and 87.3MB in the end (delta: -32.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,879 INFO L158 Benchmark]: TraceAbstraction took 19036.86ms. Allocated memory was 199.2MB in the beginning and 719.3MB in the end (delta: 520.1MB). Free memory was 86.2MB in the beginning and 438.3MB in the end (delta: -352.0MB). Peak memory consumption was 253.0MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,879 INFO L158 Benchmark]: Witness Printer took 187.78ms. Allocated memory is still 719.3MB. Free memory was 438.3MB in the beginning and 421.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:10:28,881 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.20ms. Allocated memory is still 161.5MB. Free memory was 86.3MB in the beginning and 98.2MB in the end (delta: -11.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.23ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 80.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.90ms. Allocated memory is still 161.5MB. Free memory was 80.5MB in the beginning and 55.1MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1758.53ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 55.1MB in the beginning and 87.3MB in the end (delta: -32.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19036.86ms. Allocated memory was 199.2MB in the beginning and 719.3MB in the end (delta: 520.1MB). Free memory was 86.2MB in the beginning and 438.3MB in the end (delta: -352.0MB). Peak memory consumption was 253.0MB. Max. memory is 16.1GB. * Witness Printer took 187.78ms. Allocated memory is still 719.3MB. Free memory was 438.3MB in the beginning and 421.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 175]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2267 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2267 mSDsluCounter, 2922 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 309 mSDsCounter, 1485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8261 IncrementalHoareTripleChecker+Invalid, 9746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1485 mSolverCounterUnsat, 2613 mSDtfsCounter, 8261 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8897occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 4651 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4243 NumberOfCodeBlocks, 4243 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4228 ConstructedInterpolants, 0 QuantifiedInterpolants, 7903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4703/4703 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((10 <= a25) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 11) && (278 <= a29)) && (a23 <= 312)) && (a8 == 15))) || ((((a29 <= 140) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((278 <= a29) && (a25 <= 10)) && (a23 <= 312)) && (a8 == 15))) || (((a4 == 1) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a8 == 15) && (a25 == 10)) && (a29 <= 130))) || ((a25 == 12) && (a8 == 15))) || ((((a25 <= 10) && (a23 <= 312)) && (a8 == 15)) && (a29 <= 130))) || ((((a29 <= 140) && (a25 == 11)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:10:28,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE