/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/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:52:45,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:52:45,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:52:45,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:52:45,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:52:45,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:52:45,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:52:45,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:52:45,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:52:45,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:52:45,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:52:45,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:52:45,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:52:45,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:52:45,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:52:45,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:52:45,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:52:45,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:52:45,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:52:45,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:52:45,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:52:45,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:52:45,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:52:45,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:52:45,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:52:45,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:52:45,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:52:45,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:52:45,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:52:45,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:52:45,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:52:45,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:52:45,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:52:45,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:52:45,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:52:45,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:52:45,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:52:45,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:52:45,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:52:45,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:52:45,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:52:45,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:52:45,745 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:52:45,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:52:45,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:52:45,751 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:52:45,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:52:45,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:52:45,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:52:45,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:52:45,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:52:45,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:52:45,753 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:52:45,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:52:45,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:52:45,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:52:45,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:52:45,754 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:52:45,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:52:45,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:52:45,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:52:45,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:52:45,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:52:45,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:52:45,755 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:52:46,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:52:46,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:52:46,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:52:46,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:52:46,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:52:46,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-10-24 00:52:46,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e07089fb/97669be377a749dc9b9b0e168114f66b/FLAG1d1eade62 [2020-10-24 00:52:46,959 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:52:46,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-10-24 00:52:46,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e07089fb/97669be377a749dc9b9b0e168114f66b/FLAG1d1eade62 [2020-10-24 00:52:47,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e07089fb/97669be377a749dc9b9b0e168114f66b [2020-10-24 00:52:47,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:52:47,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:52:47,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:47,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:52:47,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:52:47,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef1194d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47, skipping insertion in model container [2020-10-24 00:52:47,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:52:47,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:52:47,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:47,571 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:52:47,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:47,608 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:52:47,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47 WrapperNode [2020-10-24 00:52:47,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:47,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:52:47,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:52:47,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:52:47,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... [2020-10-24 00:52:47,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:52:47,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:52:47,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:52:47,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:52:47,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:52:47,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:52:47,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:52:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:52:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:52:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:52:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:52:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:52:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:52:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:52:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:52:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:52:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:52:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:52:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:52:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:52:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:52:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:52:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:52:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:52:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:52:48,049 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:52:48,049 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:52:48,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:48 BoogieIcfgContainer [2020-10-24 00:52:48,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:52:48,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:52:48,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:52:48,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:52:48,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:52:47" (1/3) ... [2020-10-24 00:52:48,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3e4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:48, skipping insertion in model container [2020-10-24 00:52:48,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:47" (2/3) ... [2020-10-24 00:52:48,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3e4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:48, skipping insertion in model container [2020-10-24 00:52:48,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:48" (3/3) ... [2020-10-24 00:52:48,062 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-10-24 00:52:48,077 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:52:48,084 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:52:48,121 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:52:48,189 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:52:48,190 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:52:48,190 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:52:48,190 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:52:48,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:52:48,191 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:52:48,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:52:48,191 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:52:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:52:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:52:48,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:48,252 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] [2020-10-24 00:52:48,253 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:52:48,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:48,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [115950441] [2020-10-24 00:52:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:52:48,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [115950441] [2020-10-24 00:52:48,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:48,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:48,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727256409] [2020-10-24 00:52:48,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:48,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:48,891 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:52:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:49,359 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-10-24 00:52:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:52:49,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:52:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:49,373 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:52:49,373 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:52:49,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:52:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:52:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:49,441 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:52:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:49,442 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:49,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:52:49,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:49,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] [2020-10-24 00:52:49,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:52:49,446 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:52:49,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:49,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041988243] [2020-10-24 00:52:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:52:49,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041988243] [2020-10-24 00:52:49,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:49,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:49,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325302063] [2020-10-24 00:52:49,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:49,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:49,572 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:52:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:49,858 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:52:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:52:49,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:52:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:49,861 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:52:49,861 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:52:49,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:52:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:52:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:49,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:52:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:49,881 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:49,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:52:49,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:49,884 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:49,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:52:49,884 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:52:49,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:49,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682583760] [2020-10-24 00:52:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:52:50,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682583760] [2020-10-24 00:52:50,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:50,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:50,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464348820] [2020-10-24 00:52:50,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:50,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:50,024 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-10-24 00:52:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:50,379 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:52:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:50,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:52:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:50,382 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:52:50,383 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:52:50,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:52:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:52:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:52:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:52:50,403 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:52:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:50,404 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:52:50,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:52:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:52:50,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:50,406 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:50,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:52:50,407 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:52:50,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:50,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654609545] [2020-10-24 00:52:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:52:50,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654609545] [2020-10-24 00:52:50,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:50,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:50,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65420814] [2020-10-24 00:52:50,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:50,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:50,630 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-10-24 00:52:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:51,217 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-24 00:52:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:51,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 00:52:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:51,220 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:52:51,220 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:52:51,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:52:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:52:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-10-24 00:52:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:52:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-10-24 00:52:51,243 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-10-24 00:52:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:51,244 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-24 00:52:51,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-10-24 00:52:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:52:51,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:51,248 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:51,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:52:51,248 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:52:51,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:51,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177504677] [2020-10-24 00:52:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:52:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:52:51,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177504677] [2020-10-24 00:52:51,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:51,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:51,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463549766] [2020-10-24 00:52:51,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:51,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:51,390 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-10-24 00:52:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:51,683 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-10-24 00:52:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:51,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-10-24 00:52:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:51,686 INFO L225 Difference]: With dead ends: 140 [2020-10-24 00:52:51,686 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:52:51,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:52:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:52:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:52:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-10-24 00:52:51,712 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-10-24 00:52:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:51,712 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-10-24 00:52:51,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-10-24 00:52:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:52:51,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:51,716 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:51,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:52:51,716 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:52:51,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:51,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267600232] [2020-10-24 00:52:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 00:52:51,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267600232] [2020-10-24 00:52:51,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:51,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:51,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758306736] [2020-10-24 00:52:51,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:51,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:51,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:51,893 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-10-24 00:52:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:52,404 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-10-24 00:52:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:52:52,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:52:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:52,409 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:52:52,410 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:52:52,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:52:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:52:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-10-24 00:52:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 00:52:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-10-24 00:52:52,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-10-24 00:52:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:52,448 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-10-24 00:52:52,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-10-24 00:52:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:52:52,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:52,450 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:52,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:52:52,450 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:52:52,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:52,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108530483] [2020-10-24 00:52:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:52:52,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108530483] [2020-10-24 00:52:52,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:52,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:52,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167589044] [2020-10-24 00:52:52,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:52,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:52,609 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-10-24 00:52:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:53,284 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-10-24 00:52:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:52:53,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:52:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:53,288 INFO L225 Difference]: With dead ends: 128 [2020-10-24 00:52:53,288 INFO L226 Difference]: Without dead ends: 121 [2020-10-24 00:52:53,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:52:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-24 00:52:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-10-24 00:52:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 00:52:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-10-24 00:52:53,330 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-10-24 00:52:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:53,331 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-10-24 00:52:53,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-10-24 00:52:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:52:53,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:53,333 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:53,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:52:53,334 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-10-24 00:52:53,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:53,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820724600] [2020-10-24 00:52:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 00:52:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:52:53,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820724600] [2020-10-24 00:52:53,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:53,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:53,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131564938] [2020-10-24 00:52:53,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:53,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:53,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:53,511 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-10-24 00:52:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:54,067 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-10-24 00:52:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:54,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-24 00:52:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:54,070 INFO L225 Difference]: With dead ends: 237 [2020-10-24 00:52:54,070 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:52:54,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:52:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:52:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 00:52:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:52:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-10-24 00:52:54,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-10-24 00:52:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:54,112 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-10-24 00:52:54,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-10-24 00:52:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:52:54,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:54,115 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:54,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:52:54,115 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-10-24 00:52:54,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:54,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752160137] [2020-10-24 00:52:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-24 00:52:54,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752160137] [2020-10-24 00:52:54,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:54,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:54,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772197331] [2020-10-24 00:52:54,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:54,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:54,378 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-10-24 00:52:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:54,980 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-10-24 00:52:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:54,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-24 00:52:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:54,984 INFO L225 Difference]: With dead ends: 267 [2020-10-24 00:52:54,984 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:52:54,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:52:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:52:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-10-24 00:52:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:52:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-10-24 00:52:55,033 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-10-24 00:52:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:55,035 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-10-24 00:52:55,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-10-24 00:52:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-24 00:52:55,046 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:55,046 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:55,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:52:55,046 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-10-24 00:52:55,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:55,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [434073483] [2020-10-24 00:52:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-24 00:52:55,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [434073483] [2020-10-24 00:52:55,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:55,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:55,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11547538] [2020-10-24 00:52:55,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:55,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:55,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:55,262 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-10-24 00:52:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:55,981 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-10-24 00:52:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:52:55,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2020-10-24 00:52:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:55,988 INFO L225 Difference]: With dead ends: 223 [2020-10-24 00:52:55,988 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 00:52:55,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:52:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 00:52:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-10-24 00:52:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-24 00:52:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-10-24 00:52:56,071 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 96 [2020-10-24 00:52:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:56,072 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-10-24 00:52:56,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-10-24 00:52:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:52:56,076 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:56,077 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-24 00:52:56,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:52:56,077 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-10-24 00:52:56,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:56,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [200713369] [2020-10-24 00:52:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:52:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-10-24 00:52:56,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [200713369] [2020-10-24 00:52:56,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:56,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:56,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255902327] [2020-10-24 00:52:56,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:56,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:56,332 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-10-24 00:52:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:57,030 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-10-24 00:52:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:57,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2020-10-24 00:52:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:57,036 INFO L225 Difference]: With dead ends: 455 [2020-10-24 00:52:57,036 INFO L226 Difference]: Without dead ends: 262 [2020-10-24 00:52:57,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:52:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-24 00:52:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-10-24 00:52:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-10-24 00:52:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-10-24 00:52:57,096 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 132 [2020-10-24 00:52:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:57,097 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-10-24 00:52:57,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-10-24 00:52:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:52:57,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:57,102 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-24 00:52:57,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:52:57,102 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 3 times [2020-10-24 00:52:57,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:57,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098851526] [2020-10-24 00:52:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 26 proven. 126 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2020-10-24 00:52:57,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098851526] [2020-10-24 00:52:57,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:57,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:57,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250749930] [2020-10-24 00:52:57,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:57,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:57,413 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 11 states. [2020-10-24 00:52:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:58,320 INFO L93 Difference]: Finished difference Result 359 states and 571 transitions. [2020-10-24 00:52:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:52:58,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 149 [2020-10-24 00:52:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:58,328 INFO L225 Difference]: With dead ends: 359 [2020-10-24 00:52:58,328 INFO L226 Difference]: Without dead ends: 352 [2020-10-24 00:52:58,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:52:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-24 00:52:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2020-10-24 00:52:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-10-24 00:52:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2020-10-24 00:52:58,409 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 149 [2020-10-24 00:52:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:58,409 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2020-10-24 00:52:58,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2020-10-24 00:52:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-10-24 00:52:58,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:58,417 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 10, 10, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2020-10-24 00:52:58,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:52:58,417 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1947600562, now seen corresponding path program 4 times [2020-10-24 00:52:58,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:58,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455684238] [2020-10-24 00:52:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:52:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:52:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 201 proven. 189 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2020-10-24 00:52:58,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455684238] [2020-10-24 00:52:58,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:58,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:52:58,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527334470] [2020-10-24 00:52:58,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:52:59,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:59,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:52:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:52:59,000 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 15 states. [2020-10-24 00:53:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:00,839 INFO L93 Difference]: Finished difference Result 904 states and 1697 transitions. [2020-10-24 00:53:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:53:00,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 220 [2020-10-24 00:53:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:00,851 INFO L225 Difference]: With dead ends: 904 [2020-10-24 00:53:00,851 INFO L226 Difference]: Without dead ends: 555 [2020-10-24 00:53:00,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:53:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-24 00:53:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 465. [2020-10-24 00:53:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-10-24 00:53:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 694 transitions. [2020-10-24 00:53:00,969 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 694 transitions. Word has length 220 [2020-10-24 00:53:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:00,969 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 694 transitions. [2020-10-24 00:53:00,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:53:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 694 transitions. [2020-10-24 00:53:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2020-10-24 00:53:00,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:00,979 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 12, 12, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-24 00:53:00,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:53:00,980 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1484301308, now seen corresponding path program 5 times [2020-10-24 00:53:00,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:00,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16214734] [2020-10-24 00:53:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:53:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 197 proven. 471 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-10-24 00:53:01,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [16214734] [2020-10-24 00:53:01,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:01,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:53:01,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879795790] [2020-10-24 00:53:01,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:53:01,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:01,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:53:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:53:01,811 INFO L87 Difference]: Start difference. First operand 465 states and 694 transitions. Second operand 16 states. [2020-10-24 00:53:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:03,666 INFO L93 Difference]: Finished difference Result 795 states and 1305 transitions. [2020-10-24 00:53:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:53:03,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 291 [2020-10-24 00:53:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:03,674 INFO L225 Difference]: With dead ends: 795 [2020-10-24 00:53:03,674 INFO L226 Difference]: Without dead ends: 338 [2020-10-24 00:53:03,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:53:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-10-24 00:53:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 310. [2020-10-24 00:53:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-10-24 00:53:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 435 transitions. [2020-10-24 00:53:03,746 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 435 transitions. Word has length 291 [2020-10-24 00:53:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:03,746 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 435 transitions. [2020-10-24 00:53:03,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:53:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 435 transitions. [2020-10-24 00:53:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-10-24 00:53:03,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:03,752 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:03,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:53:03,753 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash 806507396, now seen corresponding path program 6 times [2020-10-24 00:53:03,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:03,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120633944] [2020-10-24 00:53:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:03,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:53:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 261 proven. 446 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2020-10-24 00:53:04,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120633944] [2020-10-24 00:53:04,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:04,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:53:04,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964656405] [2020-10-24 00:53:04,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:53:04,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:53:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:04,495 INFO L87 Difference]: Start difference. First operand 310 states and 435 transitions. Second operand 17 states. [2020-10-24 00:53:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:06,694 INFO L93 Difference]: Finished difference Result 578 states and 875 transitions. [2020-10-24 00:53:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 00:53:06,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 290 [2020-10-24 00:53:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:06,699 INFO L225 Difference]: With dead ends: 578 [2020-10-24 00:53:06,699 INFO L226 Difference]: Without dead ends: 236 [2020-10-24 00:53:06,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:53:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-24 00:53:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2020-10-24 00:53:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-24 00:53:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2020-10-24 00:53:06,745 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 290 [2020-10-24 00:53:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:06,745 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2020-10-24 00:53:06,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:53:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2020-10-24 00:53:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-24 00:53:06,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:06,751 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:06,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:53:06,751 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:06,752 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 7 times [2020-10-24 00:53:06,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:06,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691286966] [2020-10-24 00:53:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:06,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:06,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:53:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:07,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-10-24 00:53:08,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691286966] [2020-10-24 00:53:08,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:08,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:53:08,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137776559] [2020-10-24 00:53:08,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:53:08,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:53:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:53:08,103 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand 29 states. [2020-10-24 00:53:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:11,967 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2020-10-24 00:53:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-24 00:53:11,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 237 [2020-10-24 00:53:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:11,971 INFO L225 Difference]: With dead ends: 211 [2020-10-24 00:53:11,971 INFO L226 Difference]: Without dead ends: 204 [2020-10-24 00:53:11,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=286, Invalid=4270, Unknown=0, NotChecked=0, Total=4556 [2020-10-24 00:53:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-24 00:53:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2020-10-24 00:53:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-24 00:53:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2020-10-24 00:53:12,016 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 237 [2020-10-24 00:53:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:12,016 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2020-10-24 00:53:12,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:53:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2020-10-24 00:53:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-10-24 00:53:12,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:12,022 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2020-10-24 00:53:12,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:53:12,022 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1480664230, now seen corresponding path program 8 times [2020-10-24 00:53:12,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:12,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620432712] [2020-10-24 00:53:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:53:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 332 proven. 297 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2020-10-24 00:53:12,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620432712] [2020-10-24 00:53:12,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:12,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:53:12,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187631868] [2020-10-24 00:53:12,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:53:12,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:53:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:53:12,609 INFO L87 Difference]: Start difference. First operand 194 states and 254 transitions. Second operand 19 states. [2020-10-24 00:53:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:15,230 INFO L93 Difference]: Finished difference Result 415 states and 598 transitions. [2020-10-24 00:53:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 00:53:15,230 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 255 [2020-10-24 00:53:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:15,234 INFO L225 Difference]: With dead ends: 415 [2020-10-24 00:53:15,235 INFO L226 Difference]: Without dead ends: 238 [2020-10-24 00:53:15,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=411, Invalid=2241, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 00:53:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-10-24 00:53:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 200. [2020-10-24 00:53:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-24 00:53:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 260 transitions. [2020-10-24 00:53:15,284 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 260 transitions. Word has length 255 [2020-10-24 00:53:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:15,285 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 260 transitions. [2020-10-24 00:53:15,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:53:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 260 transitions. [2020-10-24 00:53:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-10-24 00:53:15,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:15,288 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 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] [2020-10-24 00:53:15,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:53:15,289 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash 239489881, now seen corresponding path program 9 times [2020-10-24 00:53:15,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:15,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699652282] [2020-10-24 00:53:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:53:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:53:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2534 backedges. 186 proven. 556 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2020-10-24 00:53:16,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699652282] [2020-10-24 00:53:16,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:16,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:53:16,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126859712] [2020-10-24 00:53:16,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:53:16,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:53:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:53:16,127 INFO L87 Difference]: Start difference. First operand 200 states and 260 transitions. Second operand 13 states. [2020-10-24 00:53:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:17,213 INFO L93 Difference]: Finished difference Result 234 states and 309 transitions. [2020-10-24 00:53:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:53:17,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 378 [2020-10-24 00:53:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:17,215 INFO L225 Difference]: With dead ends: 234 [2020-10-24 00:53:17,215 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:53:17,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:53:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:53:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:53:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:53:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:53:17,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 378 [2020-10-24 00:53:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:17,226 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:53:17,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:53:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:53:17,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:53:17,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:53:17,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:53:18,504 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2020-10-24 00:53:18,781 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 113 [2020-10-24 00:53:32,538 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2020-10-24 00:53:33,241 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 9 [2020-10-24 00:53:33,446 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 6 [2020-10-24 00:53:33,652 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2020-10-24 00:53:34,204 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 24 [2020-10-24 00:53:35,404 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 219 DAG size of output: 38 [2020-10-24 00:53:35,586 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 6 [2020-10-24 00:53:36,565 WARN L193 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 33 [2020-10-24 00:53:37,096 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 24 [2020-10-24 00:53:38,105 WARN L193 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 201 DAG size of output: 34 [2020-10-24 00:53:39,085 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 34 [2020-10-24 00:53:39,225 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-10-24 00:53:39,773 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 27 [2020-10-24 00:53:39,930 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 3 [2020-10-24 00:53:40,393 WARN L193 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 39 [2020-10-24 00:53:40,959 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 37 [2020-10-24 00:53:41,427 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 39 [2020-10-24 00:53:41,604 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 6 [2020-10-24 00:53:43,097 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 222 DAG size of output: 40 [2020-10-24 00:53:43,259 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2020-10-24 00:53:43,773 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 27 [2020-10-24 00:53:44,409 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 37 [2020-10-24 00:53:44,915 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 45 [2020-10-24 00:53:45,358 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 27 [2020-10-24 00:53:45,562 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 8 [2020-10-24 00:53:47,137 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 222 DAG size of output: 40 [2020-10-24 00:53:47,349 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 3 [2020-10-24 00:53:47,356 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,357 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-10-24 00:53:47,358 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6)) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-10-24 00:53:47,359 INFO L270 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-10-24 00:53:47,360 INFO L270 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-10-24 00:53:47,360 INFO L277 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-10-24 00:53:47,360 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-10-24 00:53:47,360 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret9| 1) .cse0 (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) .cse0 (<= fibo2_~n 4) (<= 2 |fibo2_#t~ret9|)))) [2020-10-24 00:53:47,360 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-10-24 00:53:47,360 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret9| 1) .cse0 (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) .cse0 (<= fibo2_~n 4) (<= 2 |fibo2_#t~ret9|)))) [2020-10-24 00:53:47,361 INFO L270 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-10-24 00:53:47,361 INFO L270 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse1 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) (<= .cse0 5) .cse1 (<= 5 |fibo2_#in~n|) (<= 5 .cse0)) (and (<= .cse0 3) (<= |fibo2_#t~ret9| 2) .cse1 (<= fibo2_~n 4) (<= 3 .cse0) (<= 2 |fibo2_#t~ret9|)) (not (<= 3 |fibo2_#in~n|)) (and .cse1 (<= 6 |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret9| 1) .cse1 (<= .cse0 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse0)) (not (<= |fibo2_#in~n| 3))))) [2020-10-24 00:53:47,361 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-10-24 00:53:47,361 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse1 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) (<= .cse0 5) .cse1 (<= 5 |fibo2_#in~n|) (<= 5 .cse0)) (and (<= .cse0 3) (<= |fibo2_#t~ret9| 2) .cse1 (<= fibo2_~n 4) (<= 3 .cse0) (<= 2 |fibo2_#t~ret9|)) (not (<= 3 |fibo2_#in~n|)) (and .cse1 (<= 6 |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret9| 1) .cse1 (<= .cse0 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse0)) (not (<= |fibo2_#in~n| 3))))) [2020-10-24 00:53:47,361 INFO L270 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-10-24 00:53:47,362 INFO L270 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse1 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (let ((.cse2 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#t~ret9| 1) .cse1 (<= .cse0 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse0) (<= |fibo2_#in~n| 2)))) (and (or (and (<= .cse0 3) (<= |fibo2_#t~ret9| 2) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse1 (<= fibo2_~n 4) (<= 3 .cse0) (<= 2 |fibo2_#t~ret9|)) (and .cse1 (<= 6 |fibo2_#in~n|)) .cse2 (and (<= |fibo2_#t~ret9| 3) (<= |fibo2_#res| 5) (<= 3 |fibo2_#t~ret9|) .cse1 (<= .cse0 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|) (<= 5 .cse0))) (or .cse2 (not (<= |fibo2_#in~n| 3)))))) [2020-10-24 00:53:47,362 INFO L270 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0 (< 1 fibo2_~n) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 (<= fibo2_~n 4)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) .cse0 (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)))) [2020-10-24 00:53:47,362 INFO L270 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (or (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 (<= fibo2_~n 4)) (not (<= 3 |fibo2_#in~n|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) .cse0 (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 3))))) [2020-10-24 00:53:47,362 INFO L270 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (or (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 (<= fibo2_~n 4)) (not (<= 3 |fibo2_#in~n|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) .cse0 (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 3))))) [2020-10-24 00:53:47,362 INFO L277 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse0 (<= fibo1_~n 3) (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5) (<= 6 fibo1_~n)) (and (<= |fibo1_#in~n| 5) (<= 5 |fibo1_#in~n|) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse0 (<= fibo1_~n 3) (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5) (<= 6 fibo1_~n)) (and (<= |fibo1_#in~n| 5) (<= 5 |fibo1_#in~n|) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= 2 .cse0) (<= .cse0 2) (<= |fibo1_#t~ret7| 1) (<= fibo1_~n 3) (<= 3 |fibo1_#in~n|)) (and (<= 7 |fibo1_#in~n|) .cse1) (and (or (<= |fibo1_#in~n| 5) (and (<= 5 |fibo1_#t~ret7|) (<= 8 .cse0) (<= |fibo1_#t~ret7| 5) (<= .cse0 8))) (<= 5 |fibo1_#in~n|) .cse1))) [2020-10-24 00:53:47,363 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:53:47,364 INFO L270 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= 2 .cse0) (<= .cse0 2) (<= |fibo1_#t~ret7| 1) (<= fibo1_~n 3) (<= 3 |fibo1_#in~n|)) (and (<= 7 |fibo1_#in~n|) .cse1) (and (or (<= |fibo1_#in~n| 5) (and (<= 5 |fibo1_#t~ret7|) (<= 8 .cse0) (<= |fibo1_#t~ret7| 5) (<= .cse0 8))) (<= 5 |fibo1_#in~n|) .cse1))) [2020-10-24 00:53:47,364 INFO L270 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (let ((.cse0 (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (.cse1 (not (<= |fibo1_#in~n| 2)))) (and (or (<= |fibo1_#in~n| 0) .cse0 .cse1) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) .cse0 .cse1) (= fibo1_~n |fibo1_#in~n|) (or (not (<= 2 |fibo1_#in~n|)) (<= 7 |fibo1_#in~n|) (and (<= 5 |fibo1_#in~n|) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)))) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2))))) [2020-10-24 00:53:47,364 INFO L270 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-10-24 00:53:47,364 INFO L270 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 7 |fibo1_#in~n|) .cse0) (and (<= 5 |fibo1_#in~n|) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) (<= 8 .cse1) (<= |fibo1_#t~ret7| 5) (<= .cse1 8))) .cse0) (and (<= 2 |fibo1_#res|) (<= 1 |fibo1_#t~ret7|) (<= 2 .cse1) (<= .cse1 2) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 2) .cse0 (<= fibo1_~n 3))))) [2020-10-24 00:53:47,364 INFO L270 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (and (or (not (<= |fibo1_#in~n| 4)) (and (<= 2 |fibo1_#res|) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 2) (<= fibo1_~n 3) (<= 3 |fibo1_#in~n|))) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) .cse0 (<= |fibo1_#t~ret7| 5)) (and (<= |fibo1_#in~n| 5) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0)))) [2020-10-24 00:53:47,365 INFO L270 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (let ((.cse0 (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (.cse1 (not (<= |fibo1_#in~n| 2)))) (and (or (<= |fibo1_#in~n| 0) .cse0 .cse1) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) .cse0 .cse1) (= fibo1_~n |fibo1_#in~n|) (or (not (<= 2 |fibo1_#in~n|)) (<= 7 |fibo1_#in~n|) (and (<= 5 |fibo1_#in~n|) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)))) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2))))) [2020-10-24 00:53:47,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:53:47 BoogieIcfgContainer [2020-10-24 00:53:47,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:53:47,394 INFO L168 Benchmark]: Toolchain (without parser) took 60058.80 ms. Allocated memory was 152.0 MB in the beginning and 659.6 MB in the end (delta: 507.5 MB). Free memory was 128.5 MB in the beginning and 501.6 MB in the end (delta: -373.1 MB). Peak memory consumption was 404.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:47,394 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 97.9 MB in the beginning and 97.9 MB in the end (delta: 65.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:53:47,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.27 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:47,398 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 152.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:47,399 INFO L168 Benchmark]: RCFGBuilder took 403.90 ms. Allocated memory is still 152.0 MB. Free memory was 117.2 MB in the beginning and 128.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:47,400 INFO L168 Benchmark]: TraceAbstraction took 59338.37 ms. Allocated memory was 152.0 MB in the beginning and 659.6 MB in the end (delta: 507.5 MB). Free memory was 128.3 MB in the beginning and 501.6 MB in the end (delta: -373.3 MB). Peak memory consumption was 403.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:47,409 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.22 ms. Allocated memory is still 125.8 MB. Free memory was 97.9 MB in the beginning and 97.9 MB in the end (delta: 65.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 263.27 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 152.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 403.90 ms. Allocated memory is still 152.0 MB. Free memory was 117.2 MB in the beginning and 128.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59338.37 ms. Allocated memory was 152.0 MB in the beginning and 659.6 MB in the end (delta: 507.5 MB). Free memory was 128.3 MB in the beginning and 501.6 MB in the end (delta: -373.3 MB). Peak memory consumption was 403.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((\result <= 0 && 0 <= \result) || 0 < n) && ((((((3 <= \result && \result <= 3) && n == \old(n)) && n <= 4) || !(3 <= \old(n))) || (n == \old(n) && 6 <= \old(n))) || (((\result <= 5 && n == \old(n)) && 5 <= \old(n)) && 5 <= \result))) && ((((1 <= \result && \result <= 1) && n == \old(n)) || (n == \old(n) && \old(n) <= 0)) || !(\old(n) <= 3)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((\old(n) <= 0 || (((\old(n) <= 1 && 0 < n) && \result <= 1) && 1 <= \result)) || !(\old(n) <= 2)) && (((0 <= \result && \result <= 0) || (((\old(n) <= 1 && 0 < n) && \result <= 1) && 1 <= \result)) || !(\old(n) <= 2))) && n == \old(n)) && (((!(2 <= \old(n)) || 7 <= \old(n)) || (5 <= \old(n) && (\old(n) <= 5 || (8 <= \result && \result <= 8)))) || ((2 <= \result && \old(n) <= 3) && \result <= 2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29.0s, OverallIterations: 18, TraceHistogramMax: 21, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 999 SDtfs, 1905 SDslu, 2591 SDs, 0 SdLazy, 9331 SolverSat, 1011 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1003 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2745 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 310 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 4773 PreInvPairs, 9865 NumberOfFragments, 1332 HoareAnnotationTreeSize, 4773 FomulaSimplifications, 1511269 FormulaSimplificationTreeSizeReduction, 15.7s HoareSimplificationTime, 57 FomulaSimplificationsInter, 188094 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 6370/8949 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...