/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/loops-crafted-1/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:49:26,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:49:26,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:49:26,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:49:26,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:49:26,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:49:26,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:49:26,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:49:26,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:49:26,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:49:26,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:49:26,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:49:26,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:49:26,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:49:26,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:49:26,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:49:26,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:49:26,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:49:26,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:49:26,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:49:26,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:49:26,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:49:26,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:49:26,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:49:26,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:49:26,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:49:26,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:49:26,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:49:26,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:49:26,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:49:26,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:49:26,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:49:26,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:49:26,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:49:26,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:49:26,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:49:26,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:49:26,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:49:26,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:49:26,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:49:26,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:49:26,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:49:26,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:49:26,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:49:26,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:49:26,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:49:26,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:49:26,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:49:26,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:49:26,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:49:26,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:49:26,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:49:26,976 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:49:26,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:49:26,977 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:49:26,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:49:26,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:49:26,978 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:49:26,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:49:26,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:49:26,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:26,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:49:26,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:49:26,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:49:26,980 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:49:27,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:49:27,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:49:27,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:49:27,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:49:27,498 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:49:27,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2020-11-07 06:49:27,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1b7edea/8b588b7b0c5f44db94867f1af44eda56/FLAGc28cf30bd [2020-11-07 06:49:28,213 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:49:28,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2020-11-07 06:49:28,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1b7edea/8b588b7b0c5f44db94867f1af44eda56/FLAGc28cf30bd [2020-11-07 06:49:28,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1b7edea/8b588b7b0c5f44db94867f1af44eda56 [2020-11-07 06:49:28,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:49:28,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:49:28,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:28,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:49:28,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:49:28,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:28,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181a7bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28, skipping insertion in model container [2020-11-07 06:49:28,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:28,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:49:28,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:49:28,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:28,872 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:49:28,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:28,941 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:49:28,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28 WrapperNode [2020-11-07 06:49:28,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:28,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:49:28,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:49:28,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:49:28,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:28,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:28,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:28,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:29,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:29,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:29,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... [2020-11-07 06:49:29,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:49:29,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:49:29,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:49:29,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:49:29,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:29,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:49:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:49:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:49:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:49:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:49:29,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:49:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:49:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:49:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:49:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:49:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:49:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:49:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:49:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:49:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:49:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:49:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:49:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:49:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:49:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:49:29,546 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:49:29,546 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:49:29,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:29 BoogieIcfgContainer [2020-11-07 06:49:29,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:49:29,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:49:29,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:49:29,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:49:29,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:28" (1/3) ... [2020-11-07 06:49:29,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:29, skipping insertion in model container [2020-11-07 06:49:29,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:28" (2/3) ... [2020-11-07 06:49:29,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:29, skipping insertion in model container [2020-11-07 06:49:29,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:29" (3/3) ... [2020-11-07 06:49:29,565 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2020-11-07 06:49:29,583 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:49:29,587 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:49:29,605 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:49:29,631 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:49:29,631 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:49:29,632 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:49:29,632 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:49:29,632 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:49:29,632 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:49:29,633 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:49:29,633 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:49:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-11-07 06:49:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 06:49:29,661 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:29,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:29,663 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash -77608749, now seen corresponding path program 1 times [2020-11-07 06:49:29,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:29,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439453482] [2020-11-07 06:49:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:30,502 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-11-07 06:49:30,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:30,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439453482] [2020-11-07 06:49:30,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:30,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 06:49:30,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548055924] [2020-11-07 06:49:30,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:49:30,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:49:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:30,638 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 15 states. [2020-11-07 06:49:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:34,010 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2020-11-07 06:49:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:49:34,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2020-11-07 06:49:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:34,023 INFO L225 Difference]: With dead ends: 124 [2020-11-07 06:49:34,023 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 06:49:34,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:49:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 06:49:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2020-11-07 06:49:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-07 06:49:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2020-11-07 06:49:34,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2020-11-07 06:49:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:34,092 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2020-11-07 06:49:34,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:49:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2020-11-07 06:49:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 06:49:34,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:34,094 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:49:34,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:49:34,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -447719508, now seen corresponding path program 1 times [2020-11-07 06:49:34,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:34,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425446708] [2020-11-07 06:49:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:34,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:34,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:34,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425446708] [2020-11-07 06:49:34,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:34,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:34,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449983557] [2020-11-07 06:49:34,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:34,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:34,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:34,360 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 5 states. [2020-11-07 06:49:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:34,772 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2020-11-07 06:49:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:34,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-11-07 06:49:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:34,775 INFO L225 Difference]: With dead ends: 95 [2020-11-07 06:49:34,775 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 06:49:34,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 06:49:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2020-11-07 06:49:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-07 06:49:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2020-11-07 06:49:34,800 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2020-11-07 06:49:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:34,801 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2020-11-07 06:49:34,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2020-11-07 06:49:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 06:49:34,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:34,803 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, 1, 1, 1] [2020-11-07 06:49:34,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:49:34,803 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1452038179, now seen corresponding path program 1 times [2020-11-07 06:49:34,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:34,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [671251831] [2020-11-07 06:49:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:35,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [671251831] [2020-11-07 06:49:35,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:35,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:35,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417616565] [2020-11-07 06:49:35,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:35,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:35,027 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2020-11-07 06:49:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:35,351 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2020-11-07 06:49:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:35,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-11-07 06:49:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:35,354 INFO L225 Difference]: With dead ends: 85 [2020-11-07 06:49:35,354 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 06:49:35,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 06:49:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-11-07 06:49:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 06:49:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2020-11-07 06:49:35,377 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 45 [2020-11-07 06:49:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:35,377 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2020-11-07 06:49:35,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2020-11-07 06:49:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 06:49:35,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:35,379 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, 1, 1, 1, 1] [2020-11-07 06:49:35,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:49:35,380 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1245039122, now seen corresponding path program 1 times [2020-11-07 06:49:35,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:35,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964562842] [2020-11-07 06:49:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:35,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964562842] [2020-11-07 06:49:35,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:35,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:35,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854161539] [2020-11-07 06:49:35,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:35,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:35,887 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 9 states. [2020-11-07 06:49:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:36,564 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2020-11-07 06:49:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:36,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-11-07 06:49:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:36,567 INFO L225 Difference]: With dead ends: 93 [2020-11-07 06:49:36,567 INFO L226 Difference]: Without dead ends: 70 [2020-11-07 06:49:36,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-07 06:49:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2020-11-07 06:49:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 06:49:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2020-11-07 06:49:36,594 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 46 [2020-11-07 06:49:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:36,595 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2020-11-07 06:49:36,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-11-07 06:49:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:49:36,596 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:36,596 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, 1, 1, 1, 1, 1] [2020-11-07 06:49:36,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:49:36,597 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 153090441, now seen corresponding path program 1 times [2020-11-07 06:49:36,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:36,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608244587] [2020-11-07 06:49:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:36,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:36,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:36,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608244587] [2020-11-07 06:49:36,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:36,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:36,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435315577] [2020-11-07 06:49:36,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:36,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:36,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:36,726 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2020-11-07 06:49:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:37,004 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2020-11-07 06:49:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:37,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-11-07 06:49:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:37,006 INFO L225 Difference]: With dead ends: 92 [2020-11-07 06:49:37,007 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 06:49:37,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 06:49:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-11-07 06:49:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 06:49:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-11-07 06:49:37,035 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 47 [2020-11-07 06:49:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:37,035 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-11-07 06:49:37,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-11-07 06:49:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 06:49:37,036 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:37,036 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, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:37,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:49:37,037 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1692474488, now seen corresponding path program 1 times [2020-11-07 06:49:37,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:37,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029980537] [2020-11-07 06:49:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:37,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029980537] [2020-11-07 06:49:37,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:37,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:37,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915257535] [2020-11-07 06:49:37,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:37,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:37,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:37,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:37,358 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2020-11-07 06:49:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:42,306 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2020-11-07 06:49:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:42,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-11-07 06:49:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:42,309 INFO L225 Difference]: With dead ends: 88 [2020-11-07 06:49:42,310 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 06:49:42,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 06:49:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-11-07 06:49:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 06:49:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2020-11-07 06:49:42,346 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2020-11-07 06:49:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:42,346 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2020-11-07 06:49:42,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2020-11-07 06:49:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:42,348 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:42,348 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:42,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:49:42,349 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1096172817, now seen corresponding path program 1 times [2020-11-07 06:49:42,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:42,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937079612] [2020-11-07 06:49:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:42,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:42,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:42,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937079612] [2020-11-07 06:49:42,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:42,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:42,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700660473] [2020-11-07 06:49:42,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:42,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:42,512 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 5 states. [2020-11-07 06:49:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:42,805 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-11-07 06:49:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:42,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-11-07 06:49:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:42,807 INFO L225 Difference]: With dead ends: 90 [2020-11-07 06:49:42,807 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 06:49:42,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 06:49:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-11-07 06:49:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 06:49:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2020-11-07 06:49:42,861 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 49 [2020-11-07 06:49:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:42,861 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2020-11-07 06:49:42,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2020-11-07 06:49:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:42,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:42,868 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:42,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:49:42,868 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1795165361, now seen corresponding path program 1 times [2020-11-07 06:49:42,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:42,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552621749] [2020-11-07 06:49:42,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:43,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552621749] [2020-11-07 06:49:43,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:43,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 06:49:43,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485842284] [2020-11-07 06:49:43,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:49:43,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:49:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:49:43,380 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 17 states. [2020-11-07 06:49:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:44,834 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2020-11-07 06:49:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 06:49:44,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2020-11-07 06:49:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:44,838 INFO L225 Difference]: With dead ends: 105 [2020-11-07 06:49:44,838 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 06:49:44,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2020-11-07 06:49:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 06:49:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2020-11-07 06:49:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 06:49:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2020-11-07 06:49:44,878 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 49 [2020-11-07 06:49:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:44,880 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2020-11-07 06:49:44,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:49:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-11-07 06:49:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 06:49:44,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:44,887 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:44,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:49:44,888 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2144483504, now seen corresponding path program 2 times [2020-11-07 06:49:44,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:44,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105218185] [2020-11-07 06:49:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:49:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:45,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105218185] [2020-11-07 06:49:45,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:45,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:45,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766699398] [2020-11-07 06:49:45,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:45,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:45,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:45,316 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2020-11-07 06:49:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:46,139 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2020-11-07 06:49:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:46,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-11-07 06:49:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:46,141 INFO L225 Difference]: With dead ends: 109 [2020-11-07 06:49:46,141 INFO L226 Difference]: Without dead ends: 86 [2020-11-07 06:49:46,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:49:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-07 06:49:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2020-11-07 06:49:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 06:49:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-11-07 06:49:46,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 58 [2020-11-07 06:49:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:46,169 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-11-07 06:49:46,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-11-07 06:49:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 06:49:46,170 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:46,171 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:46,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:49:46,171 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:46,171 INFO L82 PathProgramCache]: Analyzing trace with hash 205952927, now seen corresponding path program 1 times [2020-11-07 06:49:46,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:46,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930576801] [2020-11-07 06:49:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:49:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:49:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:46,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930576801] [2020-11-07 06:49:46,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:46,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:49:46,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759263966] [2020-11-07 06:49:46,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:49:46,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:49:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:49:46,731 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 11 states. [2020-11-07 06:50:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:03,330 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2020-11-07 06:50:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:03,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-11-07 06:50:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:03,332 INFO L225 Difference]: With dead ends: 108 [2020-11-07 06:50:03,332 INFO L226 Difference]: Without dead ends: 85 [2020-11-07 06:50:03,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:50:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-07 06:50:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2020-11-07 06:50:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 06:50:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-11-07 06:50:03,367 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 59 [2020-11-07 06:50:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:03,367 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-11-07 06:50:03,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-11-07 06:50:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 06:50:03,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:03,368 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:03,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:50:03,369 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1271101974, now seen corresponding path program 1 times [2020-11-07 06:50:03,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:03,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970093323] [2020-11-07 06:50:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:03,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970093323] [2020-11-07 06:50:03,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:03,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:03,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144957127] [2020-11-07 06:50:03,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:03,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:03,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:03,885 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 10 states. [2020-11-07 06:50:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:04,842 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-11-07 06:50:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:50:04,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2020-11-07 06:50:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:04,843 INFO L225 Difference]: With dead ends: 107 [2020-11-07 06:50:04,844 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 06:50:04,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:50:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 06:50:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2020-11-07 06:50:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-07 06:50:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-11-07 06:50:04,874 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 60 [2020-11-07 06:50:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:04,874 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-11-07 06:50:04,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-11-07 06:50:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 06:50:04,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:04,875 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:04,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:50:04,876 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 961038853, now seen corresponding path program 1 times [2020-11-07 06:50:04,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:04,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [185297901] [2020-11-07 06:50:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:04,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [185297901] [2020-11-07 06:50:04,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:04,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:04,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19843539] [2020-11-07 06:50:04,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:04,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:04,993 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2020-11-07 06:50:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:05,392 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2020-11-07 06:50:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:05,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-11-07 06:50:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:05,394 INFO L225 Difference]: With dead ends: 106 [2020-11-07 06:50:05,394 INFO L226 Difference]: Without dead ends: 83 [2020-11-07 06:50:05,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-07 06:50:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-11-07 06:50:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 06:50:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2020-11-07 06:50:05,453 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 61 [2020-11-07 06:50:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:05,454 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2020-11-07 06:50:05,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2020-11-07 06:50:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 06:50:05,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:05,455 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:05,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:50:05,455 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 969071484, now seen corresponding path program 1 times [2020-11-07 06:50:05,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:05,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263973184] [2020-11-07 06:50:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:05,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:05,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:05,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:05,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263973184] [2020-11-07 06:50:05,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:05,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:05,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978671682] [2020-11-07 06:50:05,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:05,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:05,952 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2020-11-07 06:50:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:28,102 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2020-11-07 06:50:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:50:28,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-11-07 06:50:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:28,104 INFO L225 Difference]: With dead ends: 105 [2020-11-07 06:50:28,104 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 06:50:28,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=68, Invalid=237, Unknown=1, NotChecked=0, Total=306 [2020-11-07 06:50:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 06:50:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2020-11-07 06:50:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 06:50:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-11-07 06:50:28,137 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 62 [2020-11-07 06:50:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:28,138 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-11-07 06:50:28,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-11-07 06:50:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 06:50:28,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:28,145 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-07 06:50:28,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:50:28,146 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:28,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2046829461, now seen corresponding path program 1 times [2020-11-07 06:50:28,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:28,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150797329] [2020-11-07 06:50:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:28,771 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2020-11-07 06:50:28,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:28,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:28,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:28,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150797329] [2020-11-07 06:50:28,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:28,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:50:28,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651805259] [2020-11-07 06:50:28,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:50:28,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:28,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:50:28,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:50:28,884 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 19 states. [2020-11-07 06:50:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:30,556 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2020-11-07 06:50:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:50:30,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2020-11-07 06:50:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:30,559 INFO L225 Difference]: With dead ends: 133 [2020-11-07 06:50:30,559 INFO L226 Difference]: Without dead ends: 130 [2020-11-07 06:50:30,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 06:50:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-07 06:50:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2020-11-07 06:50:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-07 06:50:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2020-11-07 06:50:30,596 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 63 [2020-11-07 06:50:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:30,596 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2020-11-07 06:50:30,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:50:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2020-11-07 06:50:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 06:50:30,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:30,598 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2020-11-07 06:50:30,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:50:30,598 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -844050668, now seen corresponding path program 2 times [2020-11-07 06:50:30,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:30,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688309759] [2020-11-07 06:50:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:31,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:31,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:31,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:31,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688309759] [2020-11-07 06:50:31,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:31,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:31,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201477377] [2020-11-07 06:50:31,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:31,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:31,055 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 10 states. [2020-11-07 06:50:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:32,091 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2020-11-07 06:50:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:32,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2020-11-07 06:50:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:32,093 INFO L225 Difference]: With dead ends: 141 [2020-11-07 06:50:32,093 INFO L226 Difference]: Without dead ends: 100 [2020-11-07 06:50:32,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:50:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-07 06:50:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2020-11-07 06:50:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-07 06:50:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2020-11-07 06:50:32,132 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 72 [2020-11-07 06:50:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:32,132 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2020-11-07 06:50:32,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-11-07 06:50:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 06:50:32,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:32,133 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:32,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:50:32,135 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2050674107, now seen corresponding path program 1 times [2020-11-07 06:50:32,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:32,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613602427] [2020-11-07 06:50:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:32,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:32,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:32,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:32,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:32,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613602427] [2020-11-07 06:50:32,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:32,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:50:32,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302093213] [2020-11-07 06:50:32,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:50:32,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:50:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:32,332 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 7 states. [2020-11-07 06:50:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:45,469 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2020-11-07 06:50:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:50:45,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2020-11-07 06:50:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:45,471 INFO L225 Difference]: With dead ends: 138 [2020-11-07 06:50:45,471 INFO L226 Difference]: Without dead ends: 115 [2020-11-07 06:50:45,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:50:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-07 06:50:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2020-11-07 06:50:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-07 06:50:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2020-11-07 06:50:45,526 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 73 [2020-11-07 06:50:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:45,527 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2020-11-07 06:50:45,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:50:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2020-11-07 06:50:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 06:50:45,528 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:45,528 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2020-11-07 06:50:45,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:50:45,528 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1672083590, now seen corresponding path program 1 times [2020-11-07 06:50:45,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:45,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632650948] [2020-11-07 06:50:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:45,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632650948] [2020-11-07 06:50:45,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:45,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:50:45,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295531743] [2020-11-07 06:50:45,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:50:45,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:50:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:45,822 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 7 states. [2020-11-07 06:50:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:46,546 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2020-11-07 06:50:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:50:46,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-11-07 06:50:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:46,548 INFO L225 Difference]: With dead ends: 165 [2020-11-07 06:50:46,548 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 06:50:46,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 06:50:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2020-11-07 06:50:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 06:50:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2020-11-07 06:50:46,599 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 74 [2020-11-07 06:50:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:46,599 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2020-11-07 06:50:46,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:50:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2020-11-07 06:50:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 06:50:46,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:46,600 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:46,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:50:46,600 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1343774752, now seen corresponding path program 1 times [2020-11-07 06:50:46,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:46,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [979462280] [2020-11-07 06:50:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:47,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [979462280] [2020-11-07 06:50:47,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:47,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 06:50:47,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163584711] [2020-11-07 06:50:47,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 06:50:47,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 06:50:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:50:47,290 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 21 states. [2020-11-07 06:50:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:49,490 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2020-11-07 06:50:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:50:49,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2020-11-07 06:50:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:49,493 INFO L225 Difference]: With dead ends: 214 [2020-11-07 06:50:49,493 INFO L226 Difference]: Without dead ends: 211 [2020-11-07 06:50:49,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 06:50:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-07 06:50:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 145. [2020-11-07 06:50:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-07 06:50:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2020-11-07 06:50:49,561 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 76 [2020-11-07 06:50:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:49,561 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2020-11-07 06:50:49,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 06:50:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2020-11-07 06:50:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 06:50:49,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:49,562 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-11-07 06:50:49,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:50:49,563 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1852120895, now seen corresponding path program 2 times [2020-11-07 06:50:49,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:49,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605598563] [2020-11-07 06:50:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:49,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:50:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:50:50,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605598563] [2020-11-07 06:50:50,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:50,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:50,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334379153] [2020-11-07 06:50:50,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:50,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:50,063 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand 11 states. [2020-11-07 06:50:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:51,339 INFO L93 Difference]: Finished difference Result 214 states and 263 transitions. [2020-11-07 06:50:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:50:51,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2020-11-07 06:50:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:51,341 INFO L225 Difference]: With dead ends: 214 [2020-11-07 06:50:51,342 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 06:50:51,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:50:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 06:50:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 06:50:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 06:50:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2020-11-07 06:50:51,397 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 85 [2020-11-07 06:50:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:51,398 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2020-11-07 06:50:51,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2020-11-07 06:50:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-07 06:50:51,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:51,399 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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-11-07 06:50:51,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:50:51,399 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -267353360, now seen corresponding path program 1 times [2020-11-07 06:50:51,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:51,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [863981835] [2020-11-07 06:50:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:50:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:50:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:50:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:50:51,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [863981835] [2020-11-07 06:50:51,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:51,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:50:51,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17559991] [2020-11-07 06:50:51,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:50:51,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:50:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:51,757 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 9 states. [2020-11-07 06:51:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:16,934 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2020-11-07 06:51:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:51:16,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2020-11-07 06:51:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:16,937 INFO L225 Difference]: With dead ends: 183 [2020-11-07 06:51:16,937 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 06:51:16,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=60, Invalid=149, Unknown=1, NotChecked=0, Total=210 [2020-11-07 06:51:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 06:51:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2020-11-07 06:51:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 06:51:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2020-11-07 06:51:16,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 86 [2020-11-07 06:51:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:16,989 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2020-11-07 06:51:16,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:51:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2020-11-07 06:51:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 06:51:16,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:16,990 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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-11-07 06:51:16,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:51:16,991 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -516491035, now seen corresponding path program 1 times [2020-11-07 06:51:16,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:16,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984082622] [2020-11-07 06:51:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:51:17,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984082622] [2020-11-07 06:51:17,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:17,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:51:17,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150118009] [2020-11-07 06:51:17,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:51:17,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:51:17,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:17,638 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 12 states. [2020-11-07 06:51:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:18,901 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2020-11-07 06:51:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:51:18,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2020-11-07 06:51:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:18,903 INFO L225 Difference]: With dead ends: 175 [2020-11-07 06:51:18,903 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 06:51:18,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:51:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 06:51:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2020-11-07 06:51:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 06:51:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2020-11-07 06:51:18,957 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 87 [2020-11-07 06:51:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:18,957 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2020-11-07 06:51:18,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:51:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2020-11-07 06:51:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 06:51:18,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:18,958 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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-11-07 06:51:18,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 06:51:18,959 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1380230422, now seen corresponding path program 1 times [2020-11-07 06:51:18,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:18,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297031228] [2020-11-07 06:51:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:51:19,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297031228] [2020-11-07 06:51:19,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:19,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 06:51:19,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419156037] [2020-11-07 06:51:19,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 06:51:19,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 06:51:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2020-11-07 06:51:19,702 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 23 states. [2020-11-07 06:51:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:21,630 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2020-11-07 06:51:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:51:21,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2020-11-07 06:51:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:21,632 INFO L225 Difference]: With dead ends: 148 [2020-11-07 06:51:21,633 INFO L226 Difference]: Without dead ends: 145 [2020-11-07 06:51:21,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 06:51:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-07 06:51:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2020-11-07 06:51:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 06:51:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2020-11-07 06:51:21,693 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 88 [2020-11-07 06:51:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:21,694 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2020-11-07 06:51:21,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 06:51:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2020-11-07 06:51:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 06:51:21,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:21,700 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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] [2020-11-07 06:51:21,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 06:51:21,700 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:21,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 458987209, now seen corresponding path program 2 times [2020-11-07 06:51:21,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:21,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893824945] [2020-11-07 06:51:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:51:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:51:22,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893824945] [2020-11-07 06:51:22,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:22,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:51:22,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715070370] [2020-11-07 06:51:22,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:51:22,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:51:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:22,326 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 12 states. [2020-11-07 06:51:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:23,806 INFO L93 Difference]: Finished difference Result 191 states and 226 transitions. [2020-11-07 06:51:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:51:23,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2020-11-07 06:51:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:23,808 INFO L225 Difference]: With dead ends: 191 [2020-11-07 06:51:23,808 INFO L226 Difference]: Without dead ends: 145 [2020-11-07 06:51:23,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:51:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-07 06:51:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2020-11-07 06:51:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-07 06:51:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2020-11-07 06:51:23,894 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 97 [2020-11-07 06:51:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:23,894 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2020-11-07 06:51:23,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:51:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2020-11-07 06:51:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 06:51:23,895 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:23,895 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 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] [2020-11-07 06:51:23,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 06:51:23,896 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 711833071, now seen corresponding path program 1 times [2020-11-07 06:51:23,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:23,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085553671] [2020-11-07 06:51:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:51:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:51:24,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085553671] [2020-11-07 06:51:24,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:24,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 06:51:24,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521292657] [2020-11-07 06:51:24,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 06:51:24,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 06:51:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:51:24,775 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand 25 states. [2020-11-07 06:51:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:27,176 INFO L93 Difference]: Finished difference Result 209 states and 254 transitions. [2020-11-07 06:51:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 06:51:27,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2020-11-07 06:51:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:27,179 INFO L225 Difference]: With dead ends: 209 [2020-11-07 06:51:27,179 INFO L226 Difference]: Without dead ends: 206 [2020-11-07 06:51:27,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 06:51:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-11-07 06:51:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2020-11-07 06:51:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-07 06:51:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2020-11-07 06:51:27,306 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 99 [2020-11-07 06:51:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:27,307 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2020-11-07 06:51:27,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 06:51:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2020-11-07 06:51:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 06:51:27,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:27,310 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 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] [2020-11-07 06:51:27,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 06:51:27,310 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash 178612752, now seen corresponding path program 2 times [2020-11-07 06:51:27,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:27,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314530812] [2020-11-07 06:51:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:51:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:51:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 25 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:51:27,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314530812] [2020-11-07 06:51:27,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:27,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:51:27,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197855821] [2020-11-07 06:51:27,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:51:27,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:51:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:51:27,972 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand 13 states. [2020-11-07 06:51:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:29,623 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2020-11-07 06:51:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:51:29,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-11-07 06:51:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:29,625 INFO L225 Difference]: With dead ends: 241 [2020-11-07 06:51:29,625 INFO L226 Difference]: Without dead ends: 150 [2020-11-07 06:51:29,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:51:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-07 06:51:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-11-07 06:51:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-07 06:51:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2020-11-07 06:51:29,696 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 108 [2020-11-07 06:51:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:29,696 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2020-11-07 06:51:29,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:51:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2020-11-07 06:51:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-07 06:51:29,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:29,706 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 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] [2020-11-07 06:51:29,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 06:51:29,707 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash -606498241, now seen corresponding path program 1 times [2020-11-07 06:51:29,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:29,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167661936] [2020-11-07 06:51:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:51:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:51:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 12 proven. 119 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:51:30,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167661936] [2020-11-07 06:51:30,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:30,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 06:51:30,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836565736] [2020-11-07 06:51:30,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 06:51:30,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 06:51:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2020-11-07 06:51:30,646 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 27 states. [2020-11-07 06:51:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:33,460 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2020-11-07 06:51:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 06:51:33,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2020-11-07 06:51:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:33,462 INFO L225 Difference]: With dead ends: 169 [2020-11-07 06:51:33,463 INFO L226 Difference]: Without dead ends: 166 [2020-11-07 06:51:33,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=418, Invalid=2234, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 06:51:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-11-07 06:51:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2020-11-07 06:51:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-07 06:51:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2020-11-07 06:51:33,539 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 109 [2020-11-07 06:51:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:33,540 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2020-11-07 06:51:33,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 06:51:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2020-11-07 06:51:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-07 06:51:33,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:33,541 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 5, 4, 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] [2020-11-07 06:51:33,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 06:51:33,541 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 902064064, now seen corresponding path program 2 times [2020-11-07 06:51:33,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:33,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1968477377] [2020-11-07 06:51:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:51:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:51:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:51:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:51:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:51:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:51:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 06:51:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 14 proven. 147 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-11-07 06:51:34,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1968477377] [2020-11-07 06:51:34,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:34,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 06:51:34,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472732162] [2020-11-07 06:51:34,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 06:51:34,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 06:51:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:51:34,553 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 28 states. [2020-11-07 06:51:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:37,094 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2020-11-07 06:51:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:51:37,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2020-11-07 06:51:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:37,100 INFO L225 Difference]: With dead ends: 155 [2020-11-07 06:51:37,100 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:51:37,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=431, Invalid=2221, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 06:51:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:51:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:51:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:51:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:51:37,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2020-11-07 06:51:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:37,103 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:51:37,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 06:51:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:51:37,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:51:37,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 06:51:37,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:51:37,384 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 291 [2020-11-07 06:51:37,720 WARN L194 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 239 [2020-11-07 06:51:38,086 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 252 [2020-11-07 06:51:38,584 WARN L194 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 220 [2020-11-07 06:51:38,943 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 273 [2020-11-07 06:51:39,076 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 74 [2020-11-07 06:51:39,267 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 122 [2020-11-07 06:51:39,582 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 200 [2020-11-07 06:51:39,904 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 304 [2020-11-07 06:51:40,267 WARN L194 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 279 [2020-11-07 06:51:40,521 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 147 [2020-11-07 06:51:40,778 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 150 [2020-11-07 06:51:41,022 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 19 [2020-11-07 06:51:52,429 WARN L194 SmtUtils]: Spent 11.41 s on a formula simplification. DAG size of input: 226 DAG size of output: 45 [2020-11-07 06:51:52,534 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-11-07 06:51:53,204 WARN L194 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 37 [2020-11-07 06:51:53,398 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 21 [2020-11-07 06:51:54,278 WARN L194 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 37 [2020-11-07 06:51:54,429 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 19 [2020-11-07 06:51:54,542 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-11-07 06:51:54,646 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-11-07 06:51:54,992 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 44 [2020-11-07 06:51:55,227 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 19 [2020-11-07 06:52:00,161 WARN L194 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 185 DAG size of output: 45 [2020-11-07 06:52:00,376 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 19 [2020-11-07 06:52:01,086 WARN L194 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 37 [2020-11-07 06:52:03,410 WARN L194 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 273 DAG size of output: 19 [2020-11-07 06:52:04,365 WARN L194 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 36 [2020-11-07 06:52:04,842 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 37 [2020-11-07 06:52:05,104 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 36 [2020-11-07 06:52:05,109 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,109 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,109 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:52:05,110 INFO L269 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,111 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:05,111 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 06:52:05,111 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,111 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 06:52:05,112 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:05,112 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:52:05,112 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:05,112 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:52:05,112 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:52:05,112 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:05,112 INFO L266 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-11-07 06:52:05,113 INFO L266 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-11-07 06:52:05,113 INFO L266 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:05,113 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:05,113 INFO L262 CegarLoopResult]: At program point L31(lines 31 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-11-07 06:52:05,113 INFO L262 CegarLoopResult]: At program point L27(lines 27 36) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,113 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 16 41) the Hoare annotation is: true [2020-11-07 06:52:05,114 INFO L262 CegarLoopResult]: At program point L23(lines 23 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,114 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,114 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,114 INFO L262 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,114 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,115 INFO L262 CegarLoopResult]: At program point L33(lines 33 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L33-2(lines 23 36) the Hoare annotation is: (or (let ((.cse1 (+ main_~l~0 1)) (.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L29(lines 29 36) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L25(lines 25 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,116 INFO L269 CegarLoopResult]: At program point L21-2(lines 21 39) the Hoare annotation is: true [2020-11-07 06:52:05,116 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,116 INFO L262 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,117 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 16 41) the Hoare annotation is: true [2020-11-07 06:52:05,117 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,117 INFO L262 CegarLoopResult]: At program point L38-1(lines 21 39) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,117 INFO L262 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,117 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,117 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 16 41) the Hoare annotation is: true [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,118 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:52:05,118 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,119 INFO L262 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,119 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:52:05,119 INFO L262 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:05,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:52:05 BoogieIcfgContainer [2020-11-07 06:52:05,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:52:05,140 INFO L168 Benchmark]: Toolchain (without parser) took 156555.28 ms. Allocated memory was 166.7 MB in the beginning and 241.2 MB in the end (delta: 74.4 MB). Free memory was 143.2 MB in the beginning and 111.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:05,140 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 125.8 MB. Free memory was 105.2 MB in the beginning and 105.2 MB in the end (delta: 62.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:52:05,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.43 ms. Allocated memory is still 166.7 MB. Free memory was 142.6 MB in the beginning and 132.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:05,141 INFO L168 Benchmark]: Boogie Preprocessor took 81.53 ms. Allocated memory is still 166.7 MB. Free memory was 132.6 MB in the beginning and 131.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:05,142 INFO L168 Benchmark]: RCFGBuilder took 522.87 ms. Allocated memory is still 166.7 MB. Free memory was 131.1 MB in the beginning and 140.3 MB in the end (delta: -9.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:05,143 INFO L168 Benchmark]: TraceAbstraction took 155582.96 ms. Allocated memory was 166.7 MB in the beginning and 241.2 MB in the end (delta: 74.4 MB). Free memory was 139.9 MB in the beginning and 111.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 137.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:05,145 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.20 ms. Allocated memory is still 125.8 MB. Free memory was 105.2 MB in the beginning and 105.2 MB in the end (delta: 62.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 350.43 ms. Allocated memory is still 166.7 MB. Free memory was 142.6 MB in the beginning and 132.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.53 ms. Allocated memory is still 166.7 MB. Free memory was 132.6 MB in the beginning and 131.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 522.87 ms. Allocated memory is still 166.7 MB. Free memory was 131.1 MB in the beginning and 140.3 MB in the end (delta: -9.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 155582.96 ms. Allocated memory was 166.7 MB in the beginning and 241.2 MB in the end (delta: 74.4 MB). Free memory was 139.9 MB in the beginning and 111.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 137.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(SIZE <= 20000001) || !(20000001 <= SIZE)) || (i + j + v1 + k + v2 + v3 + v4 <= l && l <= i + j + v1 + k + v2 + v3 + v4) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || !(SIZE <= 20000001)) || !(cond == 0)) || !(20000001 <= SIZE) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 127.4s, OverallIterations: 27, TraceHistogramMax: 8, AutomataDifference: 112.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1066 SDtfs, 4390 SDslu, 2482 SDs, 0 SdLazy, 8639 SolverSat, 946 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 84.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 240 SyntacticMatches, 16 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3919 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 326 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 58 LocationsWithAnnotation, 474 PreInvPairs, 601 NumberOfFragments, 1366 HoareAnnotationTreeSize, 474 FomulaSimplifications, 939397942 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 58 FomulaSimplificationsInter, 1110290 FormulaSimplificationTreeSizeReductionInter, 24.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1898 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 707/1638 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...