/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_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:52:25,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:52:25,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:52:25,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:52:25,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:52:25,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:52:25,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:52:25,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:52:25,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:52:25,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:52:25,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:52:25,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:52:25,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:52:25,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:52:25,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:52:25,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:52:25,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:52:25,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:52:25,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:52:25,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:52:25,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:52:25,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:52:25,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:52:25,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:52:25,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:52:25,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:52:25,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:52:25,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:52:25,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:52:25,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:52:25,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:52:25,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:52:25,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:52:25,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:52:25,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:52:25,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:52:25,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:52:25,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:52:25,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:52:25,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:52:25,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:52:25,974 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:25,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:52:25,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:52:25,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:52:25,990 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:52:25,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:52:25,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:52:25,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:52:25,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:52:25,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:52:25,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:52:25,991 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:52:25,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:52:25,992 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:52:25,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:52:25,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:52:25,992 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:52:25,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:52:25,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:52:25,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:52:25,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:52:25,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:52:25,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:52:25,994 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:26,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:52:26,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:52:26,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:52:26,422 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:52:26,423 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:52:26,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-10-24 00:52:26,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceaa0367/6738810984a44c1a9645e1db90162a1d/FLAG6051fa5dd [2020-10-24 00:52:27,224 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:52:27,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-10-24 00:52:27,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceaa0367/6738810984a44c1a9645e1db90162a1d/FLAG6051fa5dd [2020-10-24 00:52:27,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ceaa0367/6738810984a44c1a9645e1db90162a1d [2020-10-24 00:52:27,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:52:27,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:52:27,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:27,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:52:27,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:52:27,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:27" (1/1) ... [2020-10-24 00:52:27,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508f21ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:27, skipping insertion in model container [2020-10-24 00:52:27,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:27" (1/1) ... [2020-10-24 00:52:27,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:52:27,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:52:27,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:27,833 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:52:27,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:27,870 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:52:27,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:27 WrapperNode [2020-10-24 00:52:27,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:27,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:52:27,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:52:27,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:52:27,886 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:27" (1/1) ... [2020-10-24 00:52:27,887 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:27" (1/1) ... [2020-10-24 00:52:27,895 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:27" (1/1) ... [2020-10-24 00:52:27,896 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:27" (1/1) ... [2020-10-24 00:52:27,902 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:27" (1/1) ... [2020-10-24 00:52:27,904 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:27" (1/1) ... [2020-10-24 00:52:27,906 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:27" (1/1) ... [2020-10-24 00:52:27,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:52:27,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:52:27,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:52:27,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:52:27,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:27" (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:27,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:52:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:52:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:52:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:52:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:52:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:52:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:52:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:52:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:52:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:52:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:52:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:52:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:52:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:52:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:52:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:52:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:52:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:52:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:52:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:52:28,308 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:52:28,308 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:52:28,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:28 BoogieIcfgContainer [2020-10-24 00:52:28,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:52:28,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:52:28,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:52:28,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:52:28,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:52:27" (1/3) ... [2020-10-24 00:52:28,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d835f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:28, skipping insertion in model container [2020-10-24 00:52:28,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:27" (2/3) ... [2020-10-24 00:52:28,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d835f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:28, skipping insertion in model container [2020-10-24 00:52:28,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:28" (3/3) ... [2020-10-24 00:52:28,366 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-10-24 00:52:28,393 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:52:28,417 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:52:28,451 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:52:28,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:52:28,478 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:52:28,479 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:52:28,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:52:28,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:52:28,479 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:52:28,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:52:28,479 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:52:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:52:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:52:28,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:28,528 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:28,529 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:52:28,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:28,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298916016] [2020-10-24 00:52:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,187 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:29,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298916016] [2020-10-24 00:52:29,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:29,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:29,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541104323] [2020-10-24 00:52:29,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:29,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:29,228 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:52:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:29,651 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-10-24 00:52:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:52:29,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:52:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:29,666 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:52:29,666 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:52:29,670 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:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:52:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:52:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:29,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:52:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:29,789 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:29,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:52:29,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:29,794 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:29,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:52:29,795 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:52:29,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:29,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935786757] [2020-10-24 00:52:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:29,994 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:29,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935786757] [2020-10-24 00:52:29,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:29,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:29,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661500223] [2020-10-24 00:52:29,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:29,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:30,003 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:52:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:30,329 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:52:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:52:30,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:52:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:30,332 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:52:30,332 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:52:30,333 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:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:52:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:52:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:30,351 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:52:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:30,352 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:30,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:52:30,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:30,355 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:30,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:52:30,355 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:52:30,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:30,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1752437677] [2020-10-24 00:52:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,507 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:30,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1752437677] [2020-10-24 00:52:30,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:30,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:30,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677506133] [2020-10-24 00:52:30,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:30,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:30,517 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-10-24 00:52:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:30,906 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:52:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:30,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:52:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:30,909 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:52:30,909 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:52:30,911 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:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:52:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:52:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:52:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:52:30,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:52:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:30,927 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:52:30,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:52:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:52:30,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:30,930 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:30,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:52:30,930 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:52:30,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:30,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508329558] [2020-10-24 00:52:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:30,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,085 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:31,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508329558] [2020-10-24 00:52:31,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:31,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:31,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218779417] [2020-10-24 00:52:31,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:31,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:31,092 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-10-24 00:52:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:31,636 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-24 00:52:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:31,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 00:52:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:31,640 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:52:31,640 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:52:31,641 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:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:52:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-10-24 00:52:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:52:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-10-24 00:52:31,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-10-24 00:52:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:31,664 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-24 00:52:31,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-10-24 00:52:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:52:31,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:31,667 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:31,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:52:31,668 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:52:31,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:31,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047933988] [2020-10-24 00:52:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:52:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:31,797 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:31,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047933988] [2020-10-24 00:52:31,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:31,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:31,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81154973] [2020-10-24 00:52:31,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:31,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:31,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:31,800 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-10-24 00:52:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:32,124 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-10-24 00:52:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:32,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-10-24 00:52:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:32,127 INFO L225 Difference]: With dead ends: 140 [2020-10-24 00:52:32,127 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:52:32,129 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:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:52:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:52:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:52:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-10-24 00:52:32,154 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-10-24 00:52:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:32,154 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-10-24 00:52:32,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-10-24 00:52:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:52:32,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:32,158 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:32,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:52:32,158 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:52:32,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:32,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722308218] [2020-10-24 00:52:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,297 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:32,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722308218] [2020-10-24 00:52:32,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:32,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:32,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735209262] [2020-10-24 00:52:32,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:32,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:32,301 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-10-24 00:52:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:32,732 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-10-24 00:52:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:52:32,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:52:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:32,737 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:52:32,737 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:52:32,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:52:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:52:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-10-24 00:52:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 00:52:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-10-24 00:52:32,781 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-10-24 00:52:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:32,782 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-10-24 00:52:32,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-10-24 00:52:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:52:32,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:32,791 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:32,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:52:32,791 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:52:32,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:32,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113758681] [2020-10-24 00:52:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,950 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:32,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113758681] [2020-10-24 00:52:32,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:32,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:32,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151089635] [2020-10-24 00:52:32,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:32,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:32,953 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-10-24 00:52:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:33,511 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-10-24 00:52:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:52:33,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:52:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:33,515 INFO L225 Difference]: With dead ends: 128 [2020-10-24 00:52:33,515 INFO L226 Difference]: Without dead ends: 121 [2020-10-24 00:52:33,516 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:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-24 00:52:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-10-24 00:52:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 00:52:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-10-24 00:52:33,552 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-10-24 00:52:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:33,553 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-10-24 00:52:33,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-10-24 00:52:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:52:33,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:33,555 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:33,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:52:33,556 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:33,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:33,556 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-10-24 00:52:33,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:33,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549502546] [2020-10-24 00:52:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 00:52:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,720 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:33,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549502546] [2020-10-24 00:52:33,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:33,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:33,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010395488] [2020-10-24 00:52:33,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:33,725 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-10-24 00:52:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:34,276 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-10-24 00:52:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:34,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-24 00:52:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:34,281 INFO L225 Difference]: With dead ends: 237 [2020-10-24 00:52:34,281 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:52:34,283 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:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:52:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 00:52:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:52:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-10-24 00:52:34,339 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-10-24 00:52:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:34,340 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-10-24 00:52:34,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-10-24 00:52:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:52:34,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:34,345 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:34,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:52:34,345 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-10-24 00:52:34,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:34,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374237639] [2020-10-24 00:52:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,565 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:34,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374237639] [2020-10-24 00:52:34,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:34,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:34,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618267150] [2020-10-24 00:52:34,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:34,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:34,575 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-10-24 00:52:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:35,193 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-10-24 00:52:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:35,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-24 00:52:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:35,197 INFO L225 Difference]: With dead ends: 267 [2020-10-24 00:52:35,198 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:52:35,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:52:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:52:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-10-24 00:52:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:52:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-10-24 00:52:35,255 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-10-24 00:52:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:35,257 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-10-24 00:52:35,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-10-24 00:52:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-24 00:52:35,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:35,260 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:35,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:52:35,260 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-10-24 00:52:35,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:35,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558048056] [2020-10-24 00:52:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,474 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:35,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558048056] [2020-10-24 00:52:35,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:35,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:35,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444265479] [2020-10-24 00:52:35,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:35,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:35,477 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-10-24 00:52:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:36,296 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-10-24 00:52:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:52:36,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2020-10-24 00:52:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:36,307 INFO L225 Difference]: With dead ends: 223 [2020-10-24 00:52:36,307 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 00:52:36,313 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:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 00:52:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-10-24 00:52:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-24 00:52:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-10-24 00:52:36,365 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 96 [2020-10-24 00:52:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:36,365 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-10-24 00:52:36,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-10-24 00:52:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:52:36,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:36,370 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:36,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:52:36,371 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-10-24 00:52:36,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:36,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [346189741] [2020-10-24 00:52:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:52:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,805 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:36,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [346189741] [2020-10-24 00:52:36,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:36,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:36,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240460615] [2020-10-24 00:52:36,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:36,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:36,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:36,808 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 11 states. [2020-10-24 00:52:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:37,639 INFO L93 Difference]: Finished difference Result 459 states and 784 transitions. [2020-10-24 00:52:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:52:37,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-10-24 00:52:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:37,646 INFO L225 Difference]: With dead ends: 459 [2020-10-24 00:52:37,647 INFO L226 Difference]: Without dead ends: 266 [2020-10-24 00:52:37,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:52:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-10-24 00:52:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2020-10-24 00:52:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-10-24 00:52:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-10-24 00:52:37,714 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 132 [2020-10-24 00:52:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:37,715 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-10-24 00:52:37,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-10-24 00:52:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-24 00:52:37,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:37,720 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-24 00:52:37,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:52:37,721 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -62145750, now seen corresponding path program 2 times [2020-10-24 00:52:37,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:37,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [612201048] [2020-10-24 00:52:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:52:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 72 proven. 115 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-10-24 00:52:38,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [612201048] [2020-10-24 00:52:38,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:38,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:52:38,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095997262] [2020-10-24 00:52:38,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:52:38,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:52:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:52:38,171 INFO L87 Difference]: Start difference. First operand 236 states and 364 transitions. Second operand 13 states. [2020-10-24 00:52:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:39,629 INFO L93 Difference]: Finished difference Result 465 states and 787 transitions. [2020-10-24 00:52:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:52:39,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2020-10-24 00:52:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:39,635 INFO L225 Difference]: With dead ends: 465 [2020-10-24 00:52:39,635 INFO L226 Difference]: Without dead ends: 214 [2020-10-24 00:52:39,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:52:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-24 00:52:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-10-24 00:52:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-24 00:52:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2020-10-24 00:52:39,689 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 150 [2020-10-24 00:52:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:39,690 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2020-10-24 00:52:39,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:52:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2020-10-24 00:52:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-10-24 00:52:39,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:39,694 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:39,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:52:39,694 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1394104132, now seen corresponding path program 3 times [2020-10-24 00:52:39,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:39,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141088297] [2020-10-24 00:52:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:52:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 133 proven. 118 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-10-24 00:52:40,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141088297] [2020-10-24 00:52:40,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:40,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:52:40,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517988413] [2020-10-24 00:52:40,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:52:40,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:40,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:52:40,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:52:40,278 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 16 states. [2020-10-24 00:52:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:42,232 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2020-10-24 00:52:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:52:42,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 167 [2020-10-24 00:52:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:42,237 INFO L225 Difference]: With dead ends: 360 [2020-10-24 00:52:42,237 INFO L226 Difference]: Without dead ends: 192 [2020-10-24 00:52:42,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:52:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-24 00:52:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2020-10-24 00:52:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-24 00:52:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2020-10-24 00:52:42,282 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 167 [2020-10-24 00:52:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:42,282 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2020-10-24 00:52:42,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:52:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2020-10-24 00:52:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-10-24 00:52:42,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:42,285 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:42,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:52:42,286 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1978690859, now seen corresponding path program 4 times [2020-10-24 00:52:42,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:42,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702816173] [2020-10-24 00:52:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 93 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-10-24 00:52:42,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702816173] [2020-10-24 00:52:42,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:42,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:52:42,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078823722] [2020-10-24 00:52:42,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:52:42,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:52:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:52:42,561 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand 12 states. [2020-10-24 00:52:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:43,458 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2020-10-24 00:52:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:52:43,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2020-10-24 00:52:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:43,464 INFO L225 Difference]: With dead ends: 350 [2020-10-24 00:52:43,464 INFO L226 Difference]: Without dead ends: 191 [2020-10-24 00:52:43,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:52:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-24 00:52:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-10-24 00:52:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-24 00:52:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2020-10-24 00:52:43,514 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 131 [2020-10-24 00:52:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:43,515 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2020-10-24 00:52:43,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:52:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2020-10-24 00:52:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:52:43,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:43,518 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:43,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:52:43,519 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 5 times [2020-10-24 00:52:43,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:43,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908062558] [2020-10-24 00:52:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:43,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:43,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:43,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:43,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:43,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-10-24 00:52:44,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908062558] [2020-10-24 00:52:44,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:44,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:52:44,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536496036] [2020-10-24 00:52:44,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:52:44,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:52:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:52:44,462 INFO L87 Difference]: Start difference. First operand 191 states and 248 transitions. Second operand 23 states. [2020-10-24 00:52:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:47,265 INFO L93 Difference]: Finished difference Result 216 states and 279 transitions. [2020-10-24 00:52:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 00:52:47,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 149 [2020-10-24 00:52:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:47,269 INFO L225 Difference]: With dead ends: 216 [2020-10-24 00:52:47,269 INFO L226 Difference]: Without dead ends: 209 [2020-10-24 00:52:47,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=244, Invalid=2836, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 00:52:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-24 00:52:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2020-10-24 00:52:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-10-24 00:52:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2020-10-24 00:52:47,321 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 149 [2020-10-24 00:52:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:47,322 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2020-10-24 00:52:47,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:52:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2020-10-24 00:52:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:52:47,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:47,326 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:47,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:52:47,327 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2116045531, now seen corresponding path program 6 times [2020-10-24 00:52:47,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:47,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [135712834] [2020-10-24 00:52:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:52:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 137 proven. 101 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2020-10-24 00:52:47,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [135712834] [2020-10-24 00:52:47,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:47,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:52:47,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948101380] [2020-10-24 00:52:47,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:52:47,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:52:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:52:47,713 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand 12 states. [2020-10-24 00:52:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:48,605 INFO L93 Difference]: Finished difference Result 369 states and 497 transitions. [2020-10-24 00:52:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:52:48,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 184 [2020-10-24 00:52:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:48,609 INFO L225 Difference]: With dead ends: 369 [2020-10-24 00:52:48,609 INFO L226 Difference]: Without dead ends: 190 [2020-10-24 00:52:48,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:52:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-24 00:52:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2020-10-24 00:52:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-24 00:52:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 240 transitions. [2020-10-24 00:52:48,657 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 240 transitions. Word has length 184 [2020-10-24 00:52:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:48,658 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 240 transitions. [2020-10-24 00:52:48,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:52:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 240 transitions. [2020-10-24 00:52:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-24 00:52:48,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:48,662 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:52:48,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:52:48,662 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 7 times [2020-10-24 00:52:48,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:48,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625716977] [2020-10-24 00:52:48,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:48,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:52:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 98 proven. 244 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-10-24 00:52:49,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625716977] [2020-10-24 00:52:49,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:49,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:52:49,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806508902] [2020-10-24 00:52:49,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:52:49,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:52:49,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:52:49,180 INFO L87 Difference]: Start difference. First operand 187 states and 240 transitions. Second operand 12 states. [2020-10-24 00:52:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:50,108 INFO L93 Difference]: Finished difference Result 223 states and 285 transitions. [2020-10-24 00:52:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:52:50,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2020-10-24 00:52:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:50,111 INFO L225 Difference]: With dead ends: 223 [2020-10-24 00:52:50,111 INFO L226 Difference]: Without dead ends: 114 [2020-10-24 00:52:50,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:52:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-24 00:52:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-24 00:52:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-24 00:52:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2020-10-24 00:52:50,137 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 237 [2020-10-24 00:52:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:50,137 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2020-10-24 00:52:50,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:52:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2020-10-24 00:52:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:52:50,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:50,140 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:50,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:52:50,141 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -720449366, now seen corresponding path program 8 times [2020-10-24 00:52:50,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:50,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306122132] [2020-10-24 00:52:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 107 proven. 178 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2020-10-24 00:52:50,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306122132] [2020-10-24 00:52:50,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:50,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:52:50,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166896712] [2020-10-24 00:52:50,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:52:50,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:52:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:52:50,566 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 15 states. [2020-10-24 00:52:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:51,959 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2020-10-24 00:52:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:52:51,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2020-10-24 00:52:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:51,967 INFO L225 Difference]: With dead ends: 114 [2020-10-24 00:52:51,967 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:52:51,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:52:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:52:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:52:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:52:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:52:51,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2020-10-24 00:52:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:51,971 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:52:51,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:52:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:52:51,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:52:51,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:52:51,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:52:53,514 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-10-24 00:52:54,101 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-10-24 00:53:03,696 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 8 [2020-10-24 00:53:03,868 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 6 [2020-10-24 00:53:04,022 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2020-10-24 00:53:04,575 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 24 [2020-10-24 00:53:04,713 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2020-10-24 00:53:05,479 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 43 [2020-10-24 00:53:06,170 WARN L193 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 37 [2020-10-24 00:53:06,722 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 24 [2020-10-24 00:53:07,447 WARN L193 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 36 [2020-10-24 00:53:08,136 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 36 [2020-10-24 00:53:08,246 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 6 [2020-10-24 00:53:08,774 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 29 [2020-10-24 00:53:09,286 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 34 [2020-10-24 00:53:09,886 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 32 [2020-10-24 00:53:10,461 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 34 [2020-10-24 00:53:11,678 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2020-10-24 00:53:11,797 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2020-10-24 00:53:12,296 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 29 [2020-10-24 00:53:12,937 WARN L193 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 32 [2020-10-24 00:53:13,395 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2020-10-24 00:53:13,854 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 35 [2020-10-24 00:53:14,020 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 8 [2020-10-24 00:53:15,169 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2020-10-24 00:53:15,324 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,324 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,325 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,325 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,325 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,325 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,326 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:15,326 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:53:15,326 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-10-24 00:53:15,327 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:15,327 INFO L270 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:15,327 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-10-24 00:53:15,328 INFO L270 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-10-24 00:53:15,328 INFO L277 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-10-24 00:53:15,329 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:53:15,329 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#t~ret9| 1)) (.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (<= 1 |fibo2_#t~ret9|)) (.cse2 (<= |fibo2_#in~n| 2))) (and (or (<= 4 |fibo2_#in~n|) (and (<= 3 fibo2_~n) (<= fibo2_~n 3) .cse0 .cse1) .cse2) (or (<= |fibo2_#in~n| 3) (and (<= |fibo2_#t~ret9| 2) .cse3 (<= 2 |fibo2_#t~ret9|)) (and .cse3 (<= 5 |fibo2_#in~n|))) (or (and .cse0 .cse3 (< 1 fibo2_~n) .cse1) (not .cse2)))) [2020-10-24 00:53:15,329 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:15,329 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#t~ret9| 1)) (.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (<= 1 |fibo2_#t~ret9|)) (.cse2 (<= |fibo2_#in~n| 2))) (and (or (<= 4 |fibo2_#in~n|) (and (<= 3 fibo2_~n) (<= fibo2_~n 3) .cse0 .cse1) .cse2) (or (<= |fibo2_#in~n| 3) (and (<= |fibo2_#t~ret9| 2) .cse3 (<= 2 |fibo2_#t~ret9|)) (and .cse3 (<= 5 |fibo2_#in~n|))) (or (and .cse0 .cse3 (< 1 fibo2_~n) .cse1) (not .cse2)))) [2020-10-24 00:53:15,329 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:15,329 INFO L270 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse3 (<= |fibo2_#t~ret9| 1)) (.cse4 (<= 1 |fibo2_#t~ret9|)) (.cse2 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse1 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse3 (<= .cse2 1) .cse4 (<= 1 .cse2) .cse1))) (and (or .cse0 (not .cse1)) (= fibo2_~n |fibo2_#in~n|) (or (and (<= .cse2 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 .cse2) (<= 2 |fibo2_#t~ret9|)) (and (<= 2 .cse2) (<= fibo2_~n 3) .cse3 (<= .cse2 2) .cse4) (<= 5 |fibo2_#in~n|) .cse0) (not (<= |fibo2_#in~n| 1))))) [2020-10-24 00:53:15,330 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:15,330 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse3 (<= |fibo2_#t~ret9| 1)) (.cse4 (<= 1 |fibo2_#t~ret9|)) (.cse2 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse1 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse3 (<= .cse2 1) .cse4 (<= 1 .cse2) .cse1))) (and (or .cse0 (not .cse1)) (= fibo2_~n |fibo2_#in~n|) (or (and (<= .cse2 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 .cse2) (<= 2 |fibo2_#t~ret9|)) (and (<= 2 .cse2) (<= fibo2_~n 3) .cse3 (<= .cse2 2) .cse4) (<= 5 |fibo2_#in~n|) .cse0) (not (<= |fibo2_#in~n| 1))))) [2020-10-24 00:53:15,330 INFO L270 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-10-24 00:53:15,330 INFO L270 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse3 (<= 1 |fibo2_#t~ret9|)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (or (and (<= 2 .cse0) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|) (<= fibo2_~n 3) .cse1 .cse2 (<= .cse0 2) .cse3) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse1 .cse2 (<= .cse0 1) .cse3 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (and .cse2 (<= 5 |fibo2_#in~n|)) (and (<= .cse0 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse2 (<= 3 .cse0) (<= 2 |fibo2_#t~ret9|)))) (not (<= |fibo2_#in~n| 1))) [2020-10-24 00:53:15,331 INFO L270 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (and (let ((.cse0 (<= |fibo2_#t~ret9| 1)) (.cse1 (<= 1 |fibo2_#t~ret9|))) (or (and (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|) .cse0 .cse1) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0 .cse1 (<= |fibo2_#in~n| 2)) (not (<= |fibo2_#in~n| 3)))) (let ((.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= fibo2_~n 3) .cse2) (and .cse2 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret9| 2) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse2 (<= 2 |fibo2_#t~ret9|)))) (not (<= |fibo2_#in~n| 1))) [2020-10-24 00:53:15,331 INFO L270 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (and (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)) (<= 5 |fibo2_#in~n|) (<= |fibo2_#in~n| 0) (and (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3)) (and (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|) (<= fibo2_~n 3))) (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|)) [2020-10-24 00:53:15,331 INFO L270 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (and (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)) (<= 5 |fibo2_#in~n|) (<= |fibo2_#in~n| 0) (and (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3)) (and (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|) (<= fibo2_~n 3))) (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|)) [2020-10-24 00:53:15,331 INFO L277 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-10-24 00:53:15,331 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:53:15,331 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)) (<= 4 |fibo1_#in~n|)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 3)) (and .cse0 (<= |fibo1_#in~n| 4)) (and .cse0 (<= 6 |fibo1_#in~n|))))) [2020-10-24 00:53:15,332 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:15,332 INFO L270 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)) (<= 4 |fibo1_#in~n|)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 3)) (and .cse0 (<= |fibo1_#in~n| 4)) (and .cse0 (<= 6 |fibo1_#in~n|))))) [2020-10-24 00:53:15,332 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:15,332 INFO L270 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse2 (<= 1 |fibo1_#t~ret7|)) (.cse3 (<= |fibo1_#t~ret7| 1)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse1) (and .cse2 (<= 2 .cse0) (<= .cse0 2) .cse3 .cse1 (<= 3 |fibo1_#in~n|)) (and .cse2 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse3 .cse1 (<= .cse0 1)))))) [2020-10-24 00:53:15,332 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:15,332 INFO L270 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse2 (<= 1 |fibo1_#t~ret7|)) (.cse3 (<= |fibo1_#t~ret7| 1)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse1) (and .cse2 (<= 2 .cse0) (<= .cse0 2) .cse3 .cse1 (<= 3 |fibo1_#in~n|)) (and .cse2 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse3 .cse1 (<= .cse0 1)))))) [2020-10-24 00:53:15,333 INFO L270 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse0) (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-10-24 00:53:15,333 INFO L270 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-10-24 00:53:15,333 INFO L270 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse2 (<= 1 |fibo1_#t~ret7|)) (.cse3 (<= |fibo1_#t~ret7| 1)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse1) (and (<= 2 |fibo1_#res|) .cse2 (<= 2 .cse0) (<= .cse0 2) .cse3 (<= |fibo1_#res| 2) .cse1 (<= 3 |fibo1_#in~n|)) (and .cse2 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse3 .cse1 (<= |fibo1_#res| 1) (<= .cse0 1) (<= 1 |fibo1_#res|)))))) [2020-10-24 00:53:15,333 INFO L270 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#in~n| 2)) (.cse0 (<= 1 |fibo1_#t~ret7|)) (.cse1 (<= |fibo1_#t~ret7| 1))) (and (not (<= |fibo1_#in~n| 1)) (or (and .cse0 .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not .cse2)) (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse3 (<= |fibo1_#in~n| 4)) (and .cse3 (<= 6 |fibo1_#in~n|)) (and (<= 3 |fibo1_#t~ret7|) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse3 (<= |fibo1_#t~ret7| 3)))) (or .cse2 (and (<= 2 |fibo1_#res|) .cse0 .cse1 (<= |fibo1_#res| 2)) (<= 4 |fibo1_#in~n|)))) [2020-10-24 00:53:15,334 INFO L270 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse0) (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-10-24 00:53:15,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:53:15 BoogieIcfgContainer [2020-10-24 00:53:15,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:53:15,368 INFO L168 Benchmark]: Toolchain (without parser) took 47796.16 ms. Allocated memory was 151.0 MB in the beginning and 594.5 MB in the end (delta: 443.5 MB). Free memory was 127.9 MB in the beginning and 268.6 MB in the end (delta: -140.7 MB). Peak memory consumption was 361.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:15,369 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:53:15,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.20 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 118.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:15,373 INFO L168 Benchmark]: Boogie Preprocessor took 36.74 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:15,374 INFO L168 Benchmark]: RCFGBuilder took 401.15 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 101.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:15,374 INFO L168 Benchmark]: TraceAbstraction took 47025.65 ms. Allocated memory was 151.0 MB in the beginning and 594.5 MB in the end (delta: 443.5 MB). Free memory was 134.6 MB in the beginning and 268.6 MB in the end (delta: -134.0 MB). Peak memory consumption was 367.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:15,386 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.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 291.20 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 118.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.74 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 401.15 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 101.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 47025.65 ms. Allocated memory was 151.0 MB in the beginning and 594.5 MB in the end (delta: 443.5 MB). Free memory was 134.6 MB in the beginning and 268.6 MB in the end (delta: -134.0 MB). Peak memory consumption was 367.0 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: 5 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((((1 <= \result && \result <= 1) && \old(n) <= 2) || 5 <= \old(n)) || \old(n) <= 0) || ((4 <= \old(n) && 3 <= \result) && \result <= 3)) || (((\result <= 2 && 3 <= n) && 2 <= \result) && n <= 3)) && ((\result <= 0 && 0 <= \result) || 0 < n)) && n == \old(n) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((4 <= \old(n) && n == \old(n)) || (((2 <= \result && \result <= 2) && n == \old(n)) && 3 <= \old(n))) || (\old(n) <= 0 && n == \old(n))) || (((\old(n) <= 2 && n == \old(n)) && \result <= 1) && 1 <= \result)) && (((5 <= \result && \result <= 5) || \old(n) <= 4) || 6 <= \old(n))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.4s, OverallIterations: 18, TraceHistogramMax: 13, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 955 SDtfs, 1637 SDslu, 2244 SDs, 0 SdLazy, 7005 SolverSat, 765 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 137 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 3261 PreInvPairs, 6458 NumberOfFragments, 1353 HoareAnnotationTreeSize, 3261 FomulaSimplifications, 750789 FormulaSimplificationTreeSizeReduction, 11.5s HoareSimplificationTime, 57 FomulaSimplificationsInter, 81144 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1903 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 551425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 2516/3565 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...