/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:36:00,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:36:00,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:36:00,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:36:00,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:36:00,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:36:00,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:36:00,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:36:00,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:36:00,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:36:00,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:36:00,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:36:00,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:36:00,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:36:00,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:36:00,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:36:00,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:36:00,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:36:00,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:36:00,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:36:00,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:36:00,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:36:00,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:36:00,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:36:00,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:36:00,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:36:00,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:36:00,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:36:00,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:36:00,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:36:00,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:36:00,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:36:00,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:36:00,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:36:00,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:36:00,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:36:00,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:36:00,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:36:00,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:36:00,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:36:00,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:36:00,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:36:00,949 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:36:00,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:36:00,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:36:00,954 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:36:00,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:36:00,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:36:00,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:36:00,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:36:00,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:36:00,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:36:00,956 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:36:00,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:36:00,957 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:36:00,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:36:00,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:36:00,958 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:36:00,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:36:00,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:36:00,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:36:00,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:36:00,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:36:00,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:36:00,960 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:36:01,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:36:01,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:36:01,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:36:01,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:36:01,415 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:36:01,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann04.c [2020-10-24 00:36:01,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36603c29c/76cae85c5e254572afdfb9e3dfd80162/FLAG7e15e6503 [2020-10-24 00:36:02,190 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:36:02,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann04.c [2020-10-24 00:36:02,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36603c29c/76cae85c5e254572afdfb9e3dfd80162/FLAG7e15e6503 [2020-10-24 00:36:02,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36603c29c/76cae85c5e254572afdfb9e3dfd80162 [2020-10-24 00:36:02,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:36:02,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:36:02,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:36:02,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:36:02,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:36:02,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc2d705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02, skipping insertion in model container [2020-10-24 00:36:02,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:36:02,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:36:02,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:36:02,868 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:36:02,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:36:02,919 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:36:02,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02 WrapperNode [2020-10-24 00:36:02,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:36:02,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:36:02,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:36:02,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:36:02,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... [2020-10-24 00:36:02,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:36:02,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:36:02,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:36:02,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:36:02,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:36:03,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:36:03,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:36:03,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:36:03,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-10-24 00:36:03,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:36:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:36:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:36:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:36:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:36:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:36:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-10-24 00:36:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:36:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:36:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:36:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:36:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:36:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:36:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:36:03,338 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:36:03,338 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:36:03,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:36:03 BoogieIcfgContainer [2020-10-24 00:36:03,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:36:03,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:36:03,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:36:03,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:36:03,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:36:02" (1/3) ... [2020-10-24 00:36:03,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a5e749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:36:03, skipping insertion in model container [2020-10-24 00:36:03,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:02" (2/3) ... [2020-10-24 00:36:03,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a5e749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:36:03, skipping insertion in model container [2020-10-24 00:36:03,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:36:03" (3/3) ... [2020-10-24 00:36:03,353 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-10-24 00:36:03,371 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:36:03,403 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:36:03,419 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:36:03,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:36:03,448 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:36:03,448 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:36:03,448 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:36:03,448 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:36:03,448 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:36:03,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:36:03,449 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:36:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-10-24 00:36:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:36:03,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:03,480 INFO L422 BasicCegarLoop]: 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] [2020-10-24 00:36:03,481 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -946996355, now seen corresponding path program 1 times [2020-10-24 00:36:03,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:03,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758700069] [2020-10-24 00:36:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:36:03,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758700069] [2020-10-24 00:36:03,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:36:03,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:36:03,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093576456] [2020-10-24 00:36:03,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:36:03,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:36:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:36:03,913 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 6 states. [2020-10-24 00:36:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:04,539 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2020-10-24 00:36:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:36:04,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-10-24 00:36:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:04,558 INFO L225 Difference]: With dead ends: 101 [2020-10-24 00:36:04,559 INFO L226 Difference]: Without dead ends: 54 [2020-10-24 00:36:04,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:36:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-24 00:36:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-24 00:36:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-24 00:36:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2020-10-24 00:36:04,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 33 [2020-10-24 00:36:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:04,660 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2020-10-24 00:36:04,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:36:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-10-24 00:36:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:36:04,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:04,669 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:36:04,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:36:04,670 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 300807360, now seen corresponding path program 1 times [2020-10-24 00:36:04,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:04,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575191982] [2020-10-24 00:36:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:04,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:04,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:04,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:36:04,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575191982] [2020-10-24 00:36:04,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:04,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:36:04,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375733568] [2020-10-24 00:36:04,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:36:04,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:36:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:36:04,862 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2020-10-24 00:36:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:05,163 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2020-10-24 00:36:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:36:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-10-24 00:36:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:05,167 INFO L225 Difference]: With dead ends: 93 [2020-10-24 00:36:05,168 INFO L226 Difference]: Without dead ends: 56 [2020-10-24 00:36:05,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:36:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-24 00:36:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-24 00:36:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 00:36:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-10-24 00:36:05,207 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 43 [2020-10-24 00:36:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:05,207 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-10-24 00:36:05,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:36:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-10-24 00:36:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 00:36:05,216 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:05,216 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2020-10-24 00:36:05,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:36:05,217 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1772464485, now seen corresponding path program 1 times [2020-10-24 00:36:05,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:05,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2099493402] [2020-10-24 00:36:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-24 00:36:05,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2099493402] [2020-10-24 00:36:05,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:05,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:36:05,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688464863] [2020-10-24 00:36:05,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:36:05,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:36:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:36:05,477 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2020-10-24 00:36:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:05,869 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2020-10-24 00:36:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:36:05,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-10-24 00:36:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:05,873 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:36:05,873 INFO L226 Difference]: Without dead ends: 78 [2020-10-24 00:36:05,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:36:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-24 00:36:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-24 00:36:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-24 00:36:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2020-10-24 00:36:05,907 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 62 [2020-10-24 00:36:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:05,908 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2020-10-24 00:36:05,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:36:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2020-10-24 00:36:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:36:05,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:05,913 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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] [2020-10-24 00:36:05,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:36:05,913 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1545390750, now seen corresponding path program 2 times [2020-10-24 00:36:05,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:05,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475843491] [2020-10-24 00:36:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-10-24 00:36:06,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475843491] [2020-10-24 00:36:06,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:06,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:36:06,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211318681] [2020-10-24 00:36:06,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:36:06,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:36:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:36:06,209 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 7 states. [2020-10-24 00:36:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:06,797 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2020-10-24 00:36:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:36:06,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-10-24 00:36:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:06,803 INFO L225 Difference]: With dead ends: 117 [2020-10-24 00:36:06,803 INFO L226 Difference]: Without dead ends: 110 [2020-10-24 00:36:06,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:36:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-24 00:36:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-24 00:36:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-24 00:36:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2020-10-24 00:36:06,844 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 81 [2020-10-24 00:36:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:06,844 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2020-10-24 00:36:06,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:36:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2020-10-24 00:36:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-10-24 00:36:06,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:06,852 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 11, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:06,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:36:06,852 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1932765146, now seen corresponding path program 3 times [2020-10-24 00:36:06,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:06,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538387191] [2020-10-24 00:36:06,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 00:36:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 197 proven. 298 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2020-10-24 00:36:07,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538387191] [2020-10-24 00:36:07,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:07,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:36:07,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623075348] [2020-10-24 00:36:07,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:36:07,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:07,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:36:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:36:07,415 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand 10 states. [2020-10-24 00:36:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:08,779 INFO L93 Difference]: Finished difference Result 230 states and 451 transitions. [2020-10-24 00:36:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:36:08,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2020-10-24 00:36:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:08,790 INFO L225 Difference]: With dead ends: 230 [2020-10-24 00:36:08,790 INFO L226 Difference]: Without dead ends: 126 [2020-10-24 00:36:08,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:36:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-24 00:36:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2020-10-24 00:36:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 00:36:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2020-10-24 00:36:08,876 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 188 [2020-10-24 00:36:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:08,876 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2020-10-24 00:36:08,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:36:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2020-10-24 00:36:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-10-24 00:36:08,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:08,883 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:08,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:36:08,883 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1837059662, now seen corresponding path program 4 times [2020-10-24 00:36:08,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:08,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739469824] [2020-10-24 00:36:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-10-24 00:36:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 110 proven. 71 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-10-24 00:36:09,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739469824] [2020-10-24 00:36:09,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:09,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:36:09,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875378561] [2020-10-24 00:36:09,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:36:09,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:36:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:36:09,356 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand 16 states. [2020-10-24 00:36:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:11,404 INFO L93 Difference]: Finished difference Result 265 states and 440 transitions. [2020-10-24 00:36:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:36:11,405 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2020-10-24 00:36:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:11,410 INFO L225 Difference]: With dead ends: 265 [2020-10-24 00:36:11,410 INFO L226 Difference]: Without dead ends: 165 [2020-10-24 00:36:11,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=1325, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:36:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-24 00:36:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2020-10-24 00:36:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 00:36:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2020-10-24 00:36:11,466 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 130 [2020-10-24 00:36:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:11,468 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2020-10-24 00:36:11,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:36:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2020-10-24 00:36:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-10-24 00:36:11,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:11,476 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:11,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:36:11,476 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1924315322, now seen corresponding path program 5 times [2020-10-24 00:36:11,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:11,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1536339156] [2020-10-24 00:36:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:36:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 181 proven. 172 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2020-10-24 00:36:12,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1536339156] [2020-10-24 00:36:12,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:12,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:12,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114962519] [2020-10-24 00:36:12,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:12,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:12,076 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand 17 states. [2020-10-24 00:36:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:15,226 INFO L93 Difference]: Finished difference Result 282 states and 452 transitions. [2020-10-24 00:36:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-10-24 00:36:15,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-10-24 00:36:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:15,231 INFO L225 Difference]: With dead ends: 282 [2020-10-24 00:36:15,231 INFO L226 Difference]: Without dead ends: 182 [2020-10-24 00:36:15,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=705, Invalid=2265, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:36:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-24 00:36:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 138. [2020-10-24 00:36:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-24 00:36:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2020-10-24 00:36:15,302 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 168 [2020-10-24 00:36:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:15,303 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2020-10-24 00:36:15,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2020-10-24 00:36:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-10-24 00:36:15,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:15,307 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 11, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:15,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:36:15,307 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1273104622, now seen corresponding path program 6 times [2020-10-24 00:36:15,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:15,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245506400] [2020-10-24 00:36:15,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 00:36:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 180 proven. 344 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2020-10-24 00:36:15,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245506400] [2020-10-24 00:36:15,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:15,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:15,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650208694] [2020-10-24 00:36:15,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:15,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:15,858 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 17 states. [2020-10-24 00:36:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:19,407 INFO L93 Difference]: Finished difference Result 330 states and 517 transitions. [2020-10-24 00:36:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-10-24 00:36:19,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2020-10-24 00:36:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:19,413 INFO L225 Difference]: With dead ends: 330 [2020-10-24 00:36:19,413 INFO L226 Difference]: Without dead ends: 206 [2020-10-24 00:36:19,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=889, Invalid=2893, Unknown=0, NotChecked=0, Total=3782 [2020-10-24 00:36:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-24 00:36:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 162. [2020-10-24 00:36:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-24 00:36:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2020-10-24 00:36:19,462 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 206 [2020-10-24 00:36:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:19,463 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2020-10-24 00:36:19,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2020-10-24 00:36:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-10-24 00:36:19,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:19,467 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 13, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:19,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:36:19,467 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1904198470, now seen corresponding path program 7 times [2020-10-24 00:36:19,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:19,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780359770] [2020-10-24 00:36:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:36:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 525 proven. 337 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2020-10-24 00:36:20,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780359770] [2020-10-24 00:36:20,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:20,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:36:20,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682504557] [2020-10-24 00:36:20,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:36:20,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:36:20,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:36:20,302 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand 23 states. [2020-10-24 00:36:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:26,770 INFO L93 Difference]: Finished difference Result 414 states and 647 transitions. [2020-10-24 00:36:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2020-10-24 00:36:26,774 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 244 [2020-10-24 00:36:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:26,782 INFO L225 Difference]: With dead ends: 414 [2020-10-24 00:36:26,782 INFO L226 Difference]: Without dead ends: 278 [2020-10-24 00:36:26,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1868, Invalid=7444, Unknown=0, NotChecked=0, Total=9312 [2020-10-24 00:36:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-10-24 00:36:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 198. [2020-10-24 00:36:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-24 00:36:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2020-10-24 00:36:26,867 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 244 [2020-10-24 00:36:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:26,868 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2020-10-24 00:36:26,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:36:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2020-10-24 00:36:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-10-24 00:36:26,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:26,874 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:26,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:36:26,874 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash 198340805, now seen corresponding path program 8 times [2020-10-24 00:36:26,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:26,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1868454666] [2020-10-24 00:36:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:26,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:36:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:36:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 588 proven. 448 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2020-10-24 00:36:27,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1868454666] [2020-10-24 00:36:27,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:27,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:36:27,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205524165] [2020-10-24 00:36:27,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:36:27,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:36:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:36:27,847 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand 24 states. [2020-10-24 00:36:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:34,864 INFO L93 Difference]: Finished difference Result 486 states and 790 transitions. [2020-10-24 00:36:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-10-24 00:36:34,864 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 263 [2020-10-24 00:36:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:34,874 INFO L225 Difference]: With dead ends: 486 [2020-10-24 00:36:34,874 INFO L226 Difference]: Without dead ends: 314 [2020-10-24 00:36:34,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2150, Invalid=8770, Unknown=0, NotChecked=0, Total=10920 [2020-10-24 00:36:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-24 00:36:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 222. [2020-10-24 00:36:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-10-24 00:36:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2020-10-24 00:36:34,947 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 263 [2020-10-24 00:36:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:34,948 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2020-10-24 00:36:34,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:36:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2020-10-24 00:36:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-10-24 00:36:34,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:34,952 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:34,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:36:34,953 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2013349288, now seen corresponding path program 9 times [2020-10-24 00:36:34,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:34,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875162787] [2020-10-24 00:36:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:36:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:36:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 00:36:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:36:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-24 00:36:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 865 proven. 70 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2020-10-24 00:36:35,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875162787] [2020-10-24 00:36:35,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:35,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:36:35,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097898494] [2020-10-24 00:36:35,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:36:35,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:35,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:36:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:36:35,987 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand 26 states. [2020-10-24 00:36:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:40,143 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2020-10-24 00:36:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-10-24 00:36:40,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 282 [2020-10-24 00:36:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:40,146 INFO L225 Difference]: With dead ends: 314 [2020-10-24 00:36:40,147 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:36:40,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1215, Invalid=4947, Unknown=0, NotChecked=0, Total=6162 [2020-10-24 00:36:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:36:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:36:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:36:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:36:40,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2020-10-24 00:36:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:40,155 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:36:40,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:36:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:36:40,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:36:40,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:36:40,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:36:44,152 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:44,407 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:44,657 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 90 [2020-10-24 00:36:45,001 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 120 [2020-10-24 00:36:45,289 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 123 [2020-10-24 00:36:45,485 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:45,696 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:45,906 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:46,035 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:46,338 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:46,481 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:46,893 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 68 [2020-10-24 00:36:47,098 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-24 00:36:47,233 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2020-10-24 00:36:47,503 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-24 00:36:47,869 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:47,995 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:48,367 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 120 [2020-10-24 00:36:48,605 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 123 [2020-10-24 00:36:48,784 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:48,947 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:49,147 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:49,293 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:49,586 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:49,719 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-10-24 00:36:50,105 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 68 [2020-10-24 00:36:50,317 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-24 00:36:50,425 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2020-10-24 00:36:50,669 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-24 00:36:51,042 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:51,177 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:51,331 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 95 [2020-10-24 00:36:51,582 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 139 [2020-10-24 00:36:51,847 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 135 [2020-10-24 00:36:52,041 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:52,215 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:52,426 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:52,561 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:52,867 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:53,014 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:53,458 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 107 [2020-10-24 00:36:53,702 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-24 00:36:53,852 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2020-10-24 00:36:54,129 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-24 00:36:54,508 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:54,637 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:54,783 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 95 [2020-10-24 00:36:55,036 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 139 [2020-10-24 00:36:55,295 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 135 [2020-10-24 00:36:55,488 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:55,661 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:55,873 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:56,004 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:56,313 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:56,466 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-10-24 00:36:56,952 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 107 [2020-10-24 00:36:57,197 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-24 00:36:57,340 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2020-10-24 00:36:57,616 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-24 00:37:00,507 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 12 [2020-10-24 00:37:00,818 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2020-10-24 00:37:01,111 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2020-10-24 00:37:01,516 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2020-10-24 00:37:01,682 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-10-24 00:37:01,873 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2020-10-24 00:37:03,626 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-10-24 00:37:03,769 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-10-24 00:37:05,727 WARN L193 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 188 DAG size of output: 41 [2020-10-24 00:37:07,584 WARN L193 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 188 DAG size of output: 41 [2020-10-24 00:37:10,353 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 251 DAG size of output: 56 [2020-10-24 00:37:13,124 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 251 DAG size of output: 56 [2020-10-24 00:37:15,441 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 148 DAG size of output: 60 [2020-10-24 00:37:15,781 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 9 [2020-10-24 00:37:17,923 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 155 DAG size of output: 49 [2020-10-24 00:37:19,518 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-10-24 00:37:19,526 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,526 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,526 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,526 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,526 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,527 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:37:19,527 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point L29(lines 29 33) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 27 47) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 27 47) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L270 CegarLoopResult]: At program point L42(lines 42 46) the Hoare annotation is: (or (<= 7 main_~result~0) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-10-24 00:37:19,528 INFO L277 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 27 47) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L270 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-10-24 00:37:19,529 INFO L270 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: false [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-10-24 00:37:19,529 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (or (<= 7 |main_#t~ret12|) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-10-24 00:37:19,529 INFO L277 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-10-24 00:37:19,530 INFO L270 CegarLoopResult]: At program point L41-2(line 41) the Hoare annotation is: (or (<= 7 |main_#t~ret12|) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-10-24 00:37:19,530 INFO L270 CegarLoopResult]: At program point L41-3(line 41) the Hoare annotation is: (or (<= main_~m~0 1) (<= main_~n~0 1) (and (<= 7 |main_#t~ret12|) (<= 7 main_~result~0))) [2020-10-24 00:37:19,530 INFO L277 CegarLoopResult]: At program point L35(lines 35 40) the Hoare annotation is: true [2020-10-24 00:37:19,530 INFO L270 CegarLoopResult]: At program point ackermannEXIT(lines 16 24) the Hoare annotation is: (let ((.cse4 (<= 1 |ackermann_#in~m|))) (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse3 (<= 3 |ackermann_#res|)) (.cse1 (not .cse4)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse5 (= |ackermann_#in~m| 0))) (and (or (and (<= 2 |ackermann_#res|) .cse0) (<= 4 |ackermann_#res|) .cse1 (and .cse2 .cse3)) (or .cse4 .cse5) (let ((.cse6 (<= |ackermann_#in~m| 1)) (.cse7 (<= 5 |ackermann_#res|))) (or (<= 7 |ackermann_#res|) (and .cse6 (<= |ackermann_#in~n| 2)) (and .cse6 (<= |ackermann_#in~n| 3) .cse7) (and .cse6 (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse0 .cse3) .cse1 (and .cse2 (<= |ackermann_#in~m| 2) .cse7))) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse5)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)))) [2020-10-24 00:37:19,530 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-10-24 00:37:19,530 INFO L270 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse3 .cse2 .cse4) (and .cse7 .cse3 .cse2 .cse4) (and (<= |ackermann_#in~m| 1) .cse3 (<= 1 |ackermann_#in~m|) .cse2))) (<= 2 |ackermann_#t~ret8|) (or (= |ackermann_#in~n| 1) (and .cse5 .cse1) (and .cse6 (<= |ackermann_#in~n| 4)) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)))) [2020-10-24 00:37:19,531 INFO L277 CegarLoopResult]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2020-10-24 00:37:19,531 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-10-24 00:37:19,531 INFO L270 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse3 .cse2 .cse4) (and .cse7 .cse3 .cse2 .cse4) (and (<= |ackermann_#in~m| 1) .cse3 (<= 1 |ackermann_#in~m|) .cse2))) (<= 2 |ackermann_#t~ret8|) (or (= |ackermann_#in~n| 1) (and .cse5 .cse1) (and .cse6 (<= |ackermann_#in~n| 4)) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)))) [2020-10-24 00:37:19,531 INFO L270 CegarLoopResult]: At program point L20(lines 20 22) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-10-24 00:37:19,531 INFO L270 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (let ((.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|) .cse1)))) [2020-10-24 00:37:19,532 INFO L270 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse4 (<= 7 |ackermann_#t~ret9|))) (and (or (= |ackermann_#in~n| 1) (and .cse0 .cse1) (and .cse2 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and .cse3 .cse4) (and (<= 6 |ackermann_#t~ret9|) .cse5 (<= |ackermann_#in~n| 4)) (and (<= 2 |ackermann_#res|) .cse6)) (or (and .cse6 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|)) (and (<= 4 |ackermann_#t~ret9|) .cse1)) (let ((.cse7 (<= |ackermann_#in~m| 2)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse6 .cse2 .cse7 .cse1 .cse8 .cse9 .cse10) (and .cse6 .cse4 .cse1 .cse9 .cse8 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse8 .cse9 .cse10) (and (<= |ackermann_#in~m| 1) .cse8 (<= 1 |ackermann_#in~m|) .cse9))))) [2020-10-24 00:37:19,532 INFO L270 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (let ((.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|) .cse1)))) [2020-10-24 00:37:19,532 INFO L270 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse4 (<= 7 |ackermann_#t~ret9|))) (and (or (= |ackermann_#in~n| 1) (and .cse0 .cse1) (and .cse2 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and .cse3 .cse4) (and (<= 6 |ackermann_#t~ret9|) .cse5 (<= |ackermann_#in~n| 4)) (and (<= 2 |ackermann_#res|) .cse6)) (or (and .cse6 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|)) (and (<= 4 |ackermann_#t~ret9|) .cse1)) (let ((.cse7 (<= |ackermann_#in~m| 2)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse6 .cse2 .cse7 .cse1 .cse8 .cse9 .cse10) (and .cse6 .cse4 .cse1 .cse9 .cse8 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse8 .cse9 .cse10) (and (<= |ackermann_#in~m| 1) .cse8 (<= 1 |ackermann_#in~m|) .cse9))))) [2020-10-24 00:37:19,532 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-10-24 00:37:19,532 INFO L270 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (or (and (<= 3 |ackermann_#res|) (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-10-24 00:37:19,533 INFO L270 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse5 (<= 6 |ackermann_#t~ret8|)) (.cse9 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= |ackermann_#in~n| 2)) (.cse14 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1)) (.cse3 (<= |ackermann_#in~m| 1)) (.cse4 (<= 7 |ackermann_#res|)) (.cse6 (<= 7 |ackermann_#t~ret9|)) (.cse12 (<= 5 |ackermann_#t~ret9|)) (.cse8 (<= |ackermann_#in~m| 2)) (.cse13 (<= 5 |ackermann_#res|))) (and (let ((.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse6 .cse8 .cse9 .cse1 .cse2))) (let ((.cse10 (<= 3 |ackermann_#t~ret9|)) (.cse11 (<= 3 |ackermann_#res|))) (or (and .cse0 (<= 2 |ackermann_#t~ret8|) .cse10 .cse11) (and .cse12 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|) .cse13) (and .cse4 .cse5 .cse6) (and (<= 6 |ackermann_#t~ret9|) (<= 6 |ackermann_#res|) .cse9 (<= |ackermann_#in~n| 4)) (and .cse7 .cse14 .cse10 .cse11))) (or (and .cse3 (<= 1 |ackermann_#in~m|)) (and .cse14 (<= 2 |ackermann_#in~m|))) (or .cse0 (and (<= 4 |ackermann_#res|) (<= 4 |ackermann_#t~ret9|))) (or .cse3 (and .cse4 .cse6) (and .cse12 .cse8 .cse13)))) [2020-10-24 00:37:19,533 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-10-24 00:37:19,533 INFO L270 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (<= |ackermann_#in~m| 2)) (.cse1 (<= 5 |ackermann_#res|)) (.cse3 (<= 7 |ackermann_#res|)) (.cse5 (<= |ackermann_#in~n| 1)) (.cse4 (<= |ackermann_#in~m| 1))) (and (let ((.cse2 (<= 2 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 (<= 1 |ackermann_#in~m|) (<= 3 |ackermann_#res|)))) (let ((.cse7 (<= 5 |ackermann_#t~ret8|)) (.cse6 (<= |ackermann_#in~n| 2))) (or .cse5 (and .cse3 .cse6 .cse0 .cse7) (and .cse4 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|) .cse1) (and .cse3 (<= 6 |ackermann_#t~ret8|)) (and .cse4 (<= 6 |ackermann_#res|) .cse7 (<= |ackermann_#in~n| 4)) (and .cse4 (<= 4 |ackermann_#res|) .cse6))) (let ((.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= 3 |ackermann_#t~ret8|) .cse8 .cse9) (and .cse5 .cse4 (<= 2 |ackermann_#t~ret8|) .cse8 .cse9))))) [2020-10-24 00:37:19,533 INFO L270 CegarLoopResult]: At program point L16(lines 16 24) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-10-24 00:37:19,533 INFO L270 CegarLoopResult]: At program point ackermannFINAL(lines 16 24) the Hoare annotation is: (let ((.cse4 (<= 1 |ackermann_#in~m|))) (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse3 (<= 3 |ackermann_#res|)) (.cse1 (not .cse4)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse5 (= |ackermann_#in~m| 0))) (and (or (and (<= 2 |ackermann_#res|) .cse0) (<= 4 |ackermann_#res|) .cse1 (and .cse2 .cse3)) (or .cse4 .cse5) (let ((.cse6 (<= |ackermann_#in~m| 1)) (.cse7 (<= 5 |ackermann_#res|))) (or (<= 7 |ackermann_#res|) (and .cse6 (<= |ackermann_#in~n| 2)) (and .cse6 (<= |ackermann_#in~n| 3) .cse7) (and .cse6 (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse0 .cse3) .cse1 (and .cse2 (<= |ackermann_#in~m| 2) .cse7))) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse5)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)))) [2020-10-24 00:37:19,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:37:19 BoogieIcfgContainer [2020-10-24 00:37:19,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:37:19,556 INFO L168 Benchmark]: Toolchain (without parser) took 76983.46 ms. Allocated memory was 151.0 MB in the beginning and 562.0 MB in the end (delta: 411.0 MB). Free memory was 127.6 MB in the beginning and 441.4 MB in the end (delta: -313.8 MB). Peak memory consumption was 343.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:37:19,557 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:37:19,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.67 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 117.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:37:19,558 INFO L168 Benchmark]: Boogie Preprocessor took 34.54 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:37:19,558 INFO L168 Benchmark]: RCFGBuilder took 384.64 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 100.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:37:19,559 INFO L168 Benchmark]: TraceAbstraction took 76210.61 ms. Allocated memory was 151.0 MB in the beginning and 562.0 MB in the end (delta: 411.0 MB). Free memory was 99.9 MB in the beginning and 441.4 MB in the end (delta: -341.5 MB). Peak memory consumption was 316.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:37:19,562 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 337.67 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 117.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.54 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 384.64 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 100.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 76210.61 ms. Allocated memory was 151.0 MB in the beginning and 562.0 MB in the end (delta: 411.0 MB). Free memory was 99.9 MB in the beginning and 441.4 MB in the end (delta: -341.5 MB). Peak memory consumption was 316.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann: ((((((((2 <= \result && \old(n) == 0) || 4 <= \result) || !(1 <= \old(m))) || (\old(n) <= 1 && 3 <= \result)) && (1 <= \old(m) || \old(m) == 0)) && ((((((7 <= \result || (\old(m) <= 1 && \old(n) <= 2)) || ((\old(m) <= 1 && \old(n) <= 3) && 5 <= \result)) || ((\old(m) <= 1 && 6 <= \result) && \old(n) <= 4)) || (\old(n) == 0 && 3 <= \result)) || !(1 <= \old(m))) || ((\old(n) <= 1 && \old(m) <= 2) && 5 <= \result))) && (\old(n) + 1 <= \result || !(\old(m) == 0))) && n == \old(n)) && m == \old(m) - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 36.7s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 608 SDtfs, 1311 SDslu, 1051 SDs, 0 SdLazy, 6097 SolverSat, 1231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8777 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 301 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 2616 PreInvPairs, 8202 NumberOfFragments, 1265 HoareAnnotationTreeSize, 2616 FomulaSimplifications, 9184232 FormulaSimplificationTreeSizeReduction, 20.0s HoareSimplificationTime, 56 FomulaSimplificationsInter, 886335 FormulaSimplificationTreeSizeReductionInter, 19.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1689 ConstructedInterpolants, 0 QuantifiedInterpolants, 666741 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 7332/9115 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...