/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-simple/sum_15x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:08:21,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:08:21,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:08:21,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:08:21,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:08:21,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:08:21,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:08:21,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:08:21,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:08:21,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:08:21,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:08:21,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:08:21,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:08:21,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:08:21,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:08:21,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:08:21,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:08:21,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:08:21,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:08:21,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:08:21,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:08:21,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:08:21,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:08:21,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:08:21,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:08:21,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:08:21,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:08:21,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:08:21,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:08:21,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:08:21,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:08:21,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:08:21,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:08:21,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:08:21,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:08:21,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:08:21,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:08:21,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:08:21,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:08:21,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:08:21,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:08:21,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:08:21,875 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:08:21,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:08:21,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:08:21,880 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:08:21,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:08:21,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:08:21,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:08:21,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:08:21,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:08:21,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:08:21,883 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:08:21,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:08:21,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:08:21,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:08:21,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:08:21,884 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:08:21,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:08:21,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:08:21,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:08:21,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:08:21,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:08:21,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:08:21,885 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-11-07 05:08:22,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:08:22,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:08:22,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:08:22,404 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:08:22,405 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:08:22,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-11-07 05:08:22,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2610c076a/32c86c236ace48f5bb583d15f5942c3b/FLAGf32c6f563 [2020-11-07 05:08:23,171 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:08:23,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-11-07 05:08:23,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2610c076a/32c86c236ace48f5bb583d15f5942c3b/FLAGf32c6f563 [2020-11-07 05:08:23,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2610c076a/32c86c236ace48f5bb583d15f5942c3b [2020-11-07 05:08:23,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:08:23,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:08:23,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:08:23,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:08:23,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:08:23,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b33cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23, skipping insertion in model container [2020-11-07 05:08:23,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:08:23,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:08:23,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:08:23,765 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:08:23,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:08:23,797 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:08:23,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23 WrapperNode [2020-11-07 05:08:23,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:08:23,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:08:23,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:08:23,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:08:23,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (1/1) ... [2020-11-07 05:08:23,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:08:23,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:08:23,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:08:23,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:08:23,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (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-11-07 05:08:23,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:08:23,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:08:23,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:08:23,908 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 05:08:23,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:08:23,908 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:08:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:08:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:08:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:08:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 05:08:23,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:08:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:08:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:08:24,318 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:08:24,319 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:08:24,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:24 BoogieIcfgContainer [2020-11-07 05:08:24,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:08:24,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:08:24,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:08:24,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:08:24,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:08:23" (1/3) ... [2020-11-07 05:08:24,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36444837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:24, skipping insertion in model container [2020-11-07 05:08:24,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:23" (2/3) ... [2020-11-07 05:08:24,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36444837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:24, skipping insertion in model container [2020-11-07 05:08:24,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:24" (3/3) ... [2020-11-07 05:08:24,331 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2020-11-07 05:08:24,348 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:08:24,372 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:08:24,387 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:08:24,414 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:08:24,414 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:08:24,415 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:08:24,415 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:08:24,415 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:08:24,415 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:08:24,415 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:08:24,415 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:08:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 05:08:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 05:08:24,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:24,445 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] [2020-11-07 05:08:24,446 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 05:08:24,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:24,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130058024] [2020-11-07 05:08:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:24,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:24,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:08:24,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130058024] [2020-11-07 05:08:24,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:08:24,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:08:24,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989583924] [2020-11-07 05:08:24,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:08:24,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:08:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:08:24,904 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 05:08:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:25,247 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 05:08:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:08:25,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 05:08:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:25,260 INFO L225 Difference]: With dead ends: 52 [2020-11-07 05:08:25,261 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 05:08:25,264 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-11-07 05:08:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 05:08:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 05:08:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 05:08:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 05:08:25,323 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 05:08:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:25,323 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 05:08:25,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:08:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 05:08:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 05:08:25,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:25,327 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] [2020-11-07 05:08:25,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:08:25,327 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 05:08:25,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:25,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620647092] [2020-11-07 05:08:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 05:08:25,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620647092] [2020-11-07 05:08:25,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:25,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:08:25,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209251648] [2020-11-07 05:08:25,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:08:25,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:08:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:08:25,608 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 05:08:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:25,886 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 05:08:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:08:25,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 05:08:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:25,889 INFO L225 Difference]: With dead ends: 46 [2020-11-07 05:08:25,889 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:08:25,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:08:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:08:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:08:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:08:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 05:08:25,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 05:08:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:25,906 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 05:08:25,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:08:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 05:08:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 05:08:25,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:25,908 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-11-07 05:08:25,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:08:25,909 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 05:08:25,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:25,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793043831] [2020-11-07 05:08:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:25,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 05:08:26,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793043831] [2020-11-07 05:08:26,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:26,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:08:26,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402777781] [2020-11-07 05:08:26,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:08:26,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:08:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:08:26,076 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 05:08:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:26,430 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 05:08:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:08:26,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 05:08:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:26,432 INFO L225 Difference]: With dead ends: 51 [2020-11-07 05:08:26,432 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 05:08:26,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:08:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 05:08:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 05:08:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 05:08:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 05:08:26,447 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 05:08:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:26,448 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 05:08:26,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:08:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 05:08:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 05:08:26,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:26,450 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2020-11-07 05:08:26,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:08:26,450 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 05:08:26,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:26,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193878955] [2020-11-07 05:08:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 05:08:26,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193878955] [2020-11-07 05:08:26,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:26,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:08:26,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767120745] [2020-11-07 05:08:26,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:08:26,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:08:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:08:26,669 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 05:08:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:27,088 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 05:08:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:08:27,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 05:08:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:27,090 INFO L225 Difference]: With dead ends: 56 [2020-11-07 05:08:27,091 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 05:08:27,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:08:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 05:08:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 05:08:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 05:08:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 05:08:27,106 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 05:08:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:27,107 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 05:08:27,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:08:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 05:08:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 05:08:27,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:27,109 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:08:27,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:08:27,110 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 05:08:27,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:27,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788616656] [2020-11-07 05:08:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 05:08:27,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788616656] [2020-11-07 05:08:27,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:27,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:08:27,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044581850] [2020-11-07 05:08:27,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:08:27,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:08:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:08:27,333 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 05:08:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:27,863 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 05:08:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:08:27,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 05:08:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:27,865 INFO L225 Difference]: With dead ends: 61 [2020-11-07 05:08:27,865 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 05:08:27,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:08:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 05:08:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 05:08:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 05:08:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 05:08:27,886 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 05:08:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:27,887 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 05:08:27,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:08:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 05:08:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 05:08:27,888 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:27,889 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2020-11-07 05:08:27,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:08:27,889 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 05:08:27,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:27,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995094773] [2020-11-07 05:08:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:27,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 05:08:28,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995094773] [2020-11-07 05:08:28,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:28,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:08:28,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971245806] [2020-11-07 05:08:28,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:08:28,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:08:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:08:28,122 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 05:08:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:28,665 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 05:08:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:08:28,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 05:08:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:28,670 INFO L225 Difference]: With dead ends: 66 [2020-11-07 05:08:28,670 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:08:28,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:08:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:08:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:08:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:08:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 05:08:28,687 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 05:08:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:28,688 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 05:08:28,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:08:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 05:08:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:08:28,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:28,690 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 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-11-07 05:08:28,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:08:28,691 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 05:08:28,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:28,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740645763] [2020-11-07 05:08:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 05:08:28,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740645763] [2020-11-07 05:08:28,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:28,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:08:28,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145560579] [2020-11-07 05:08:28,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:08:28,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:08:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:08:28,959 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 05:08:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:29,537 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 05:08:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:08:29,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 05:08:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:29,539 INFO L225 Difference]: With dead ends: 71 [2020-11-07 05:08:29,540 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 05:08:29,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:08:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 05:08:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 05:08:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 05:08:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 05:08:29,557 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 05:08:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:29,557 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 05:08:29,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:08:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 05:08:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 05:08:29,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:29,563 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 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-11-07 05:08:29,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:08:29,563 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 05:08:29,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:29,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525616056] [2020-11-07 05:08:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:29,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 05:08:30,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525616056] [2020-11-07 05:08:30,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:30,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:08:30,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169660750] [2020-11-07 05:08:30,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:08:30,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:08:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:08:30,070 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 05:08:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:30,658 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 05:08:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:08:30,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 05:08:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:30,661 INFO L225 Difference]: With dead ends: 76 [2020-11-07 05:08:30,661 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 05:08:30,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:08:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 05:08:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 05:08:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 05:08:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 05:08:30,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 05:08:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:30,689 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 05:08:30,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:08:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 05:08:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 05:08:30,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:30,701 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 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-11-07 05:08:30,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:08:30,701 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 05:08:30,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:30,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735554956] [2020-11-07 05:08:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:30,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 05:08:31,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735554956] [2020-11-07 05:08:31,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:31,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:08:31,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303639797] [2020-11-07 05:08:31,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:08:31,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:08:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:08:31,139 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 05:08:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:31,769 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 05:08:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:08:31,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 05:08:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:31,771 INFO L225 Difference]: With dead ends: 81 [2020-11-07 05:08:31,771 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 05:08:31,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:08:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 05:08:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 05:08:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 05:08:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 05:08:31,801 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 05:08:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:31,803 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 05:08:31,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:08:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 05:08:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 05:08:31,804 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:31,805 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 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-11-07 05:08:31,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:08:31,805 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 05:08:31,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:31,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814475987] [2020-11-07 05:08:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:31,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 05:08:32,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1814475987] [2020-11-07 05:08:32,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:32,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:08:32,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566460148] [2020-11-07 05:08:32,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:08:32,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:08:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:08:32,274 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 05:08:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:32,919 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 05:08:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:08:32,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 05:08:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:32,921 INFO L225 Difference]: With dead ends: 86 [2020-11-07 05:08:32,921 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:08:32,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:08:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:08:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:08:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:08:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 05:08:32,955 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 05:08:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:32,955 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 05:08:32,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:08:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 05:08:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 05:08:32,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:32,957 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 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-11-07 05:08:32,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:08:32,957 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 05:08:32,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:32,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997546215] [2020-11-07 05:08:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-11-07 05:08:33,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997546215] [2020-11-07 05:08:33,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:33,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:08:33,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642419299] [2020-11-07 05:08:33,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:08:33,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:08:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:08:33,477 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-11-07 05:08:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:34,224 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-11-07 05:08:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:08:34,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-11-07 05:08:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:34,226 INFO L225 Difference]: With dead ends: 91 [2020-11-07 05:08:34,226 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 05:08:34,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:08:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 05:08:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-07 05:08:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 05:08:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-11-07 05:08:34,241 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-11-07 05:08:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:34,242 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-11-07 05:08:34,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:08:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-11-07 05:08:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 05:08:34,244 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:34,244 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 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-11-07 05:08:34,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:08:34,244 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-11-07 05:08:34,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:34,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256598866] [2020-11-07 05:08:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-11-07 05:08:34,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256598866] [2020-11-07 05:08:34,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:34,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:08:34,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965566128] [2020-11-07 05:08:34,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:08:34,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:08:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:08:34,818 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-11-07 05:08:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:35,711 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-11-07 05:08:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:08:35,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-11-07 05:08:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:35,714 INFO L225 Difference]: With dead ends: 96 [2020-11-07 05:08:35,714 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 05:08:35,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:08:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 05:08:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-07 05:08:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 05:08:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-11-07 05:08:35,730 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-11-07 05:08:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:35,730 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-11-07 05:08:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:08:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-11-07 05:08:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 05:08:35,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:35,733 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 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-11-07 05:08:35,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:08:35,733 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-11-07 05:08:35,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:35,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66356760] [2020-11-07 05:08:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-11-07 05:08:36,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66356760] [2020-11-07 05:08:36,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:36,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:08:36,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7704960] [2020-11-07 05:08:36,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:08:36,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:08:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:08:36,322 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-11-07 05:08:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:37,192 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-11-07 05:08:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:08:37,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-11-07 05:08:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:37,196 INFO L225 Difference]: With dead ends: 101 [2020-11-07 05:08:37,196 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 05:08:37,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:08:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 05:08:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-07 05:08:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 05:08:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-11-07 05:08:37,211 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-11-07 05:08:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:37,211 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-11-07 05:08:37,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:08:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-11-07 05:08:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 05:08:37,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:37,214 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 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-11-07 05:08:37,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:08:37,214 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-11-07 05:08:37,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:37,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67084704] [2020-11-07 05:08:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-11-07 05:08:37,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67084704] [2020-11-07 05:08:37,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:37,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:08:37,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461940445] [2020-11-07 05:08:37,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:08:37,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:08:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:08:37,885 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-11-07 05:08:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:38,830 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-11-07 05:08:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:08:38,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-11-07 05:08:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:38,833 INFO L225 Difference]: With dead ends: 106 [2020-11-07 05:08:38,833 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 05:08:38,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:08:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 05:08:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-11-07 05:08:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 05:08:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-11-07 05:08:38,855 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-11-07 05:08:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:38,855 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-11-07 05:08:38,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:08:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-11-07 05:08:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 05:08:38,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:38,858 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 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-11-07 05:08:38,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:08:38,859 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-11-07 05:08:38,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:38,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144331542] [2020-11-07 05:08:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:38,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:38,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:38,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-11-07 05:08:39,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144331542] [2020-11-07 05:08:39,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:39,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:08:39,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098296327] [2020-11-07 05:08:39,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:08:39,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:08:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:08:39,774 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-11-07 05:08:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:40,780 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-11-07 05:08:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:08:40,781 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-11-07 05:08:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:40,782 INFO L225 Difference]: With dead ends: 111 [2020-11-07 05:08:40,782 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 05:08:40,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:08:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 05:08:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-07 05:08:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 05:08:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-11-07 05:08:40,798 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-11-07 05:08:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:40,799 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-11-07 05:08:40,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:08:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-11-07 05:08:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-07 05:08:40,801 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:40,801 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 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-11-07 05:08:40,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:08:40,802 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-11-07 05:08:40,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:40,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335330305] [2020-11-07 05:08:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:40,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:40,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:41,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:08:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 539 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2020-11-07 05:08:42,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335330305] [2020-11-07 05:08:42,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:42,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2020-11-07 05:08:42,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112755473] [2020-11-07 05:08:42,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-11-07 05:08:42,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-07 05:08:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 05:08:42,997 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 42 states. [2020-11-07 05:08:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:50,004 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 05:08:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-11-07 05:08:50,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2020-11-07 05:08:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:50,005 INFO L225 Difference]: With dead ends: 104 [2020-11-07 05:08:50,005 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:08:50,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1810, Invalid=7502, Unknown=0, NotChecked=0, Total=9312 [2020-11-07 05:08:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:08:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:08:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:08:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:08:50,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2020-11-07 05:08:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:50,014 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:08:50,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-11-07 05:08:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:08:50,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:08:50,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:08:50,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:08:51,895 WARN L194 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2020-11-07 05:08:52,820 WARN L194 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-11-07 05:08:53,658 WARN L194 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-11-07 05:08:54,814 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-11-07 05:08:55,871 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,047 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,048 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,048 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,048 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,050 INFO L262 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-11-07 05:08:56,050 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,050 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:08:56,051 INFO L262 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-11-07 05:08:56,052 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-11-07 05:08:56,052 INFO L262 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 05:08:56,052 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-11-07 05:08:56,053 INFO L262 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 05:08:56,053 INFO L262 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-11-07 05:08:56,054 INFO L262 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (and (let ((.cse17 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse17)) (.cse3 (<= |sum_#t~ret7| .cse17))) (or (let ((.cse2 (+ |sum_#in~m| 12))) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= .cse2 |sum_#t~ret7|) .cse3 (<= .cse2 |sum_#res|))) (let ((.cse4 (+ |sum_#in~m| 10))) (and (<= .cse4 |sum_#res|) .cse0 .cse1 (<= .cse4 |sum_#t~ret7|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse5 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= .cse5 |sum_#t~ret7|) (<= .cse5 |sum_#res|) .cse3)) (let ((.cse6 (+ |sum_#in~m| 6))) (and (<= .cse6 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6) (<= .cse6 |sum_#t~ret7|) .cse3)) (let ((.cse7 (+ |sum_#in~m| 14))) (and (<= .cse7 |sum_#t~ret7|) (<= .cse7 |sum_#res|) .cse0 .cse1 .cse3)) (let ((.cse8 (+ |sum_#in~m| 13))) (and .cse0 (<= .cse8 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse1 (<= .cse8 |sum_#res|) .cse3)) (let ((.cse9 (+ |sum_#in~m| 11))) (and (<= .cse9 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11) .cse3 (<= .cse9 |sum_#t~ret7|))) (let ((.cse10 (+ |sum_#in~m| 3))) (and (<= .cse10 |sum_#t~ret7|) .cse0 (<= |sum_#in~n| 3) .cse1 (<= .cse10 |sum_#res|) .cse3)) (let ((.cse11 (+ |sum_#in~m| 9))) (and .cse0 .cse1 (<= .cse11 |sum_#res|) (<= .cse11 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse3)) (let ((.cse12 (+ |sum_#in~m| 8))) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= .cse12 |sum_#res|) (<= .cse12 |sum_#t~ret7|) .cse3)) (let ((.cse13 (+ |sum_#in~m| 7))) (and .cse0 (<= .cse13 |sum_#res|) (<= |sum_#in~n| 7) .cse1 (<= .cse13 |sum_#t~ret7|) .cse3)) (let ((.cse14 (+ |sum_#in~m| 4))) (and (<= .cse14 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse0 .cse1 (<= .cse14 |sum_#res|) .cse3)) (let ((.cse15 (+ |sum_#in~m| 1))) (and (<= .cse15 |sum_#t~ret7|) (<= .cse15 |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1 .cse3)) (let ((.cse16 (+ |sum_#in~m| 2))) (and (<= .cse16 |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1 .cse3 (<= .cse16 |sum_#t~ret7|)))))) (let ((.cse18 (= sum_~n |sum_#in~n|))) (or (and .cse18 (<= |sum_#in~n| 14)) (let ((.cse19 (+ |sum_#in~m| 15))) (and .cse18 (<= .cse19 |sum_#res|) (<= .cse19 |sum_#t~ret7|)))))) [2020-11-07 05:08:56,054 INFO L262 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-11-07 05:08:56,054 INFO L262 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-11-07 05:08:56,055 INFO L269 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-11-07 05:08:56,055 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-11-07 05:08:56,055 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-11-07 05:08:56,055 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-11-07 05:08:56,055 INFO L262 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= 15 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 05:08:56,055 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-11-07 05:08:56,055 INFO L262 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 15 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 05:08:56,056 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= 15 main_~a~0) (<= main_~a~0 15)) [2020-11-07 05:08:56,056 INFO L262 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 05:08:56,056 INFO L262 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-11-07 05:08:56,056 INFO L262 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 05:08:56,056 INFO L262 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 05:08:56,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:56 BoogieIcfgContainer [2020-11-07 05:08:56,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:08:56,082 INFO L168 Benchmark]: Toolchain (without parser) took 32524.14 ms. Allocated memory was 154.1 MB in the beginning and 389.0 MB in the end (delta: 234.9 MB). Free memory was 130.5 MB in the beginning and 355.8 MB in the end (delta: -225.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:56,083 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 154.1 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:56,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.46 ms. Allocated memory is still 154.1 MB. Free memory was 129.8 MB in the beginning and 120.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:56,084 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 ms. Allocated memory is still 154.1 MB. Free memory was 120.8 MB in the beginning and 119.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:56,085 INFO L168 Benchmark]: RCFGBuilder took 491.06 ms. Allocated memory is still 154.1 MB. Free memory was 119.4 MB in the beginning and 106.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:56,086 INFO L168 Benchmark]: TraceAbstraction took 31758.05 ms. Allocated memory was 154.1 MB in the beginning and 389.0 MB in the end (delta: 234.9 MB). Free memory was 105.8 MB in the beginning and 355.8 MB in the end (delta: -249.9 MB). Peak memory consumption was 204.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:56,088 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 154.1 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 233.46 ms. Allocated memory is still 154.1 MB. Free memory was 129.8 MB in the beginning and 120.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.73 ms. Allocated memory is still 154.1 MB. Free memory was 120.8 MB in the beginning and 119.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 491.06 ms. Allocated memory is still 154.1 MB. Free memory was 119.4 MB in the beginning and 106.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31758.05 ms. Allocated memory was 154.1 MB in the beginning and 389.0 MB in the end (delta: 234.9 MB). Free memory was 105.8 MB in the beginning and 355.8 MB in the end (delta: -249.9 MB). Peak memory consumption was 204.9 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: 5]: Procedure Contract for sum Derived contract for procedure sum: (((((((((((((((((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m)) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((\old(m) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || ((\old(m) + 14 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) && ((n == \old(n) && \old(n) <= 14) || (n == \old(n) && \old(m) + 15 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 15 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.6s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 458 SDtfs, 1346 SDslu, 1037 SDs, 0 SdLazy, 2444 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 109 PreInvPairs, 334 NumberOfFragments, 1702 HoareAnnotationTreeSize, 109 FomulaSimplifications, 4473 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 39 FomulaSimplificationsInter, 6506 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1512 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 588266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 3125/5640 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...