/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/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:38:51,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:38:51,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:38:51,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:38:51,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:38:51,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:38:51,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:38:51,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:38:51,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:38:51,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:38:51,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:38:51,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:38:51,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:38:51,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:38:51,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:38:51,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:38:51,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:38:51,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:38:51,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:38:51,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:38:51,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:38:51,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:38:51,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:38:51,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:38:51,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:38:51,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:38:51,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:38:51,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:38:51,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:38:51,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:38:51,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:38:51,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:38:51,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:38:51,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:38:51,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:38:51,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:38:51,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:38:51,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:38:51,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:38:51,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:38:51,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:38:51,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:38:51,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:38:51,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:38:51,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:38:51,809 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:38:51,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:38:51,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:38:51,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:38:51,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:38:51,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:38:51,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:38:51,811 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:38:51,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:38:51,812 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:38:51,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:38:51,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:38:51,812 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:38:51,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:38:51,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:38:51,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:51,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:38:51,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:38:51,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:38:51,814 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:38:52,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:38:52,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:38:52,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:38:52,297 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:38:52,299 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:38:52,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2020-10-24 02:38:52,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b94d217/e12969c98f774ae4825cd4b20476a13e/FLAG5b281e41e [2020-10-24 02:38:52,976 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:38:52,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2020-10-24 02:38:52,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b94d217/e12969c98f774ae4825cd4b20476a13e/FLAG5b281e41e [2020-10-24 02:38:53,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b94d217/e12969c98f774ae4825cd4b20476a13e [2020-10-24 02:38:53,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:38:53,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:38:53,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:53,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:38:53,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:38:53,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296912aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53, skipping insertion in model container [2020-10-24 02:38:53,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:38:53,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:38:53,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:53,738 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:38:53,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:53,783 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:38:53,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53 WrapperNode [2020-10-24 02:38:53,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:53,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:38:53,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:38:53,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:38:53,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... [2020-10-24 02:38:53,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:38:53,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:38:53,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:38:53,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:38:53,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:38:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:38:53,905 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:38:53,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:38:53,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:38:53,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:38:53,905 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:38:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:38:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:38:53,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:38:54,332 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:38:54,332 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 02:38:54,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:54 BoogieIcfgContainer [2020-10-24 02:38:54,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:38:54,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:38:54,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:38:54,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:38:54,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:53" (1/3) ... [2020-10-24 02:38:54,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6017ad70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:54, skipping insertion in model container [2020-10-24 02:38:54,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:53" (2/3) ... [2020-10-24 02:38:54,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6017ad70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:54, skipping insertion in model container [2020-10-24 02:38:54,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:54" (3/3) ... [2020-10-24 02:38:54,345 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2020-10-24 02:38:54,359 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:38:54,364 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:38:54,379 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:38:54,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:38:54,406 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:38:54,406 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:38:54,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:38:54,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:38:54,406 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:38:54,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:38:54,407 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:38:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-10-24 02:38:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-24 02:38:54,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:54,437 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, 1, 1] [2020-10-24 02:38:54,437 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1798983212, now seen corresponding path program 1 times [2020-10-24 02:38:54,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:54,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342032203] [2020-10-24 02:38:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,492 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2020-10-24 02:38:55,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:55,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342032203] [2020-10-24 02:38:55,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:55,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-24 02:38:55,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647863343] [2020-10-24 02:38:55,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 02:38:55,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:55,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 02:38:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:38:55,632 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 17 states. [2020-10-24 02:38:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:57,265 INFO L93 Difference]: Finished difference Result 198 states and 272 transitions. [2020-10-24 02:38:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 02:38:57,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2020-10-24 02:38:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:57,279 INFO L225 Difference]: With dead ends: 198 [2020-10-24 02:38:57,280 INFO L226 Difference]: Without dead ends: 142 [2020-10-24 02:38:57,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2020-10-24 02:38:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-24 02:38:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 64. [2020-10-24 02:38:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 02:38:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2020-10-24 02:38:57,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 37 [2020-10-24 02:38:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:57,361 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2020-10-24 02:38:57,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 02:38:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2020-10-24 02:38:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 02:38:57,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:57,364 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, 1, 1] [2020-10-24 02:38:57,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:38:57,364 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1332374799, now seen corresponding path program 1 times [2020-10-24 02:38:57,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:57,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009272657] [2020-10-24 02:38:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:57,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:57,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:38:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:57,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009272657] [2020-10-24 02:38:57,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:57,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:57,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917203379] [2020-10-24 02:38:57,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:57,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:57,641 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 5 states. [2020-10-24 02:38:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:58,085 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2020-10-24 02:38:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:58,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-10-24 02:38:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:58,088 INFO L225 Difference]: With dead ends: 109 [2020-10-24 02:38:58,088 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 02:38:58,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 02:38:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2020-10-24 02:38:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 02:38:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2020-10-24 02:38:58,121 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 46 [2020-10-24 02:38:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:58,121 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2020-10-24 02:38:58,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2020-10-24 02:38:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 02:38:58,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:58,124 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-10-24 02:38:58,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:38:58,124 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2032386084, now seen corresponding path program 1 times [2020-10-24 02:38:58,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:58,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647479542] [2020-10-24 02:38:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:38:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:58,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [647479542] [2020-10-24 02:38:58,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:58,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:58,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550810768] [2020-10-24 02:38:58,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:58,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:58,266 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2020-10-24 02:38:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:58,620 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2020-10-24 02:38:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:58,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-10-24 02:38:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:58,623 INFO L225 Difference]: With dead ends: 108 [2020-10-24 02:38:58,623 INFO L226 Difference]: Without dead ends: 81 [2020-10-24 02:38:58,625 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-10-24 02:38:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-24 02:38:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2020-10-24 02:38:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 02:38:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2020-10-24 02:38:58,672 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 47 [2020-10-24 02:38:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:58,673 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2020-10-24 02:38:58,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-10-24 02:38:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:38:58,677 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:58,678 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-10-24 02:38:58,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:38:58,679 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -4154153, now seen corresponding path program 1 times [2020-10-24 02:38:58,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:58,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177406021] [2020-10-24 02:38:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:38:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:58,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177406021] [2020-10-24 02:38:58,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:58,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:58,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470904193] [2020-10-24 02:38:58,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:58,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:58,975 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2020-10-24 02:38:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:59,458 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2020-10-24 02:38:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:59,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-10-24 02:38:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:59,462 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:38:59,463 INFO L226 Difference]: Without dead ends: 80 [2020-10-24 02:38:59,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-24 02:38:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-10-24 02:38:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-24 02:38:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2020-10-24 02:38:59,493 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 48 [2020-10-24 02:38:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:59,493 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2020-10-24 02:38:59,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-10-24 02:38:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 02:38:59,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:59,495 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-10-24 02:38:59,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:38:59,495 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1977304566, now seen corresponding path program 1 times [2020-10-24 02:38:59,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:59,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053093655] [2020-10-24 02:38:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:38:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:59,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053093655] [2020-10-24 02:38:59,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:59,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:38:59,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268028233] [2020-10-24 02:38:59,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:38:59,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:38:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:38:59,881 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 9 states. [2020-10-24 02:39:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:00,701 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2020-10-24 02:39:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:39:00,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-24 02:39:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:00,704 INFO L225 Difference]: With dead ends: 106 [2020-10-24 02:39:00,704 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 02:39:00,705 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-10-24 02:39:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 02:39:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2020-10-24 02:39:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-24 02:39:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2020-10-24 02:39:00,745 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 49 [2020-10-24 02:39:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:00,745 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2020-10-24 02:39:00,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2020-10-24 02:39:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-24 02:39:00,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:00,747 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, 1] [2020-10-24 02:39:00,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:39:00,748 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1985370435, now seen corresponding path program 1 times [2020-10-24 02:39:00,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:00,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485721661] [2020-10-24 02:39:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,688 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-10-24 02:39:01,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:01,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485721661] [2020-10-24 02:39:01,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:01,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 02:39:01,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68035181] [2020-10-24 02:39:01,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 02:39:01,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 02:39:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:39:01,936 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 20 states. [2020-10-24 02:39:02,755 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-10-24 02:39:02,907 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-10-24 02:39:03,151 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-10-24 02:39:03,333 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-10-24 02:39:03,544 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-10-24 02:39:03,849 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2020-10-24 02:39:04,404 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-24 02:39:04,546 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-10-24 02:39:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:11,501 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2020-10-24 02:39:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:39:11,502 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-10-24 02:39:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:11,503 INFO L225 Difference]: With dead ends: 168 [2020-10-24 02:39:11,504 INFO L226 Difference]: Without dead ends: 141 [2020-10-24 02:39:11,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=384, Invalid=1022, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 02:39:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-24 02:39:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 70. [2020-10-24 02:39:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-24 02:39:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-10-24 02:39:11,540 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 50 [2020-10-24 02:39:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:11,540 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-10-24 02:39:11,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 02:39:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-10-24 02:39:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-24 02:39:11,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:11,542 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, 1, 1] [2020-10-24 02:39:11,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:39:11,542 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1205357584, now seen corresponding path program 1 times [2020-10-24 02:39:11,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:11,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494285704] [2020-10-24 02:39:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:11,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494285704] [2020-10-24 02:39:11,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:11,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:11,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489436264] [2020-10-24 02:39:11,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:11,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:11,721 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 5 states. [2020-10-24 02:39:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:12,053 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2020-10-24 02:39:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:12,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-10-24 02:39:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:12,055 INFO L225 Difference]: With dead ends: 104 [2020-10-24 02:39:12,055 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 02:39:12,056 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-10-24 02:39:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 02:39:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2020-10-24 02:39:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-24 02:39:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2020-10-24 02:39:12,088 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 51 [2020-10-24 02:39:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2020-10-24 02:39:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-10-24 02:39:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 02:39:12,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:12,090 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, 1, 1, 1] [2020-10-24 02:39:12,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:39:12,090 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1764708189, now seen corresponding path program 1 times [2020-10-24 02:39:12,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:12,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876248333] [2020-10-24 02:39:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,271 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-10-24 02:39:13,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:13,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876248333] [2020-10-24 02:39:13,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:13,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 02:39:13,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820239651] [2020-10-24 02:39:13,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 02:39:13,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 02:39:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:39:13,610 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 20 states. [2020-10-24 02:39:14,525 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-10-24 02:39:14,671 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-10-24 02:39:14,813 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-10-24 02:39:15,009 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-10-24 02:39:15,213 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-10-24 02:39:15,487 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2020-10-24 02:39:15,798 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-24 02:39:15,961 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-10-24 02:39:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:22,794 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2020-10-24 02:39:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:39:22,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2020-10-24 02:39:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:22,796 INFO L225 Difference]: With dead ends: 145 [2020-10-24 02:39:22,796 INFO L226 Difference]: Without dead ends: 118 [2020-10-24 02:39:22,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 02:39:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-24 02:39:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2020-10-24 02:39:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 02:39:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-10-24 02:39:22,839 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 52 [2020-10-24 02:39:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:22,840 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-10-24 02:39:22,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 02:39:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-10-24 02:39:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 02:39:22,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:22,841 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, 1, 1, 1, 1] [2020-10-24 02:39:22,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:39:22,842 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash -894652970, now seen corresponding path program 1 times [2020-10-24 02:39:22,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:22,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1787417820] [2020-10-24 02:39:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:22,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1787417820] [2020-10-24 02:39:22,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:22,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:22,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617056261] [2020-10-24 02:39:22,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:22,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:22,967 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 5 states. [2020-10-24 02:39:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:23,305 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2020-10-24 02:39:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:23,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-10-24 02:39:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:23,307 INFO L225 Difference]: With dead ends: 102 [2020-10-24 02:39:23,308 INFO L226 Difference]: Without dead ends: 75 [2020-10-24 02:39:23,308 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-10-24 02:39:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-24 02:39:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-10-24 02:39:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-24 02:39:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2020-10-24 02:39:23,353 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 53 [2020-10-24 02:39:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:23,355 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2020-10-24 02:39:23,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2020-10-24 02:39:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 02:39:23,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:23,360 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, 1, 1, 1, 1] [2020-10-24 02:39:23,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:39:23,361 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:23,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1593645514, now seen corresponding path program 1 times [2020-10-24 02:39:23,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:23,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [73297176] [2020-10-24 02:39:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,882 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-10-24 02:39:23,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:23,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [73297176] [2020-10-24 02:39:23,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:23,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 02:39:23,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277059535] [2020-10-24 02:39:23,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 02:39:23,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 02:39:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:39:23,985 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 19 states. [2020-10-24 02:39:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:25,615 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2020-10-24 02:39:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 02:39:25,616 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2020-10-24 02:39:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:25,617 INFO L225 Difference]: With dead ends: 121 [2020-10-24 02:39:25,618 INFO L226 Difference]: Without dead ends: 118 [2020-10-24 02:39:25,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 02:39:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-24 02:39:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2020-10-24 02:39:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-24 02:39:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2020-10-24 02:39:25,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 53 [2020-10-24 02:39:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:25,676 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2020-10-24 02:39:25,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 02:39:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2020-10-24 02:39:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 02:39:25,678 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:25,678 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, 1, 1] [2020-10-24 02:39:25,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:39:25,678 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2012205873, now seen corresponding path program 2 times [2020-10-24 02:39:25,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:25,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497153547] [2020-10-24 02:39:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:26,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497153547] [2020-10-24 02:39:26,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:26,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:26,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132597995] [2020-10-24 02:39:26,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:26,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:26,162 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2020-10-24 02:39:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:27,104 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2020-10-24 02:39:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:27,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2020-10-24 02:39:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:27,106 INFO L225 Difference]: With dead ends: 125 [2020-10-24 02:39:27,106 INFO L226 Difference]: Without dead ends: 98 [2020-10-24 02:39:27,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:39:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-24 02:39:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2020-10-24 02:39:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 02:39:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-10-24 02:39:27,164 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 62 [2020-10-24 02:39:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:27,164 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-10-24 02:39:27,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-10-24 02:39:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 02:39:27,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:27,165 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, 1, 1, 1, 1] [2020-10-24 02:39:27,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:39:27,166 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1862508026, now seen corresponding path program 1 times [2020-10-24 02:39:27,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:27,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316950756] [2020-10-24 02:39:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:27,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316950756] [2020-10-24 02:39:27,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:27,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:27,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971952191] [2020-10-24 02:39:27,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:27,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:27,284 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 6 states. [2020-10-24 02:39:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:27,777 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2020-10-24 02:39:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:27,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2020-10-24 02:39:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:27,779 INFO L225 Difference]: With dead ends: 124 [2020-10-24 02:39:27,779 INFO L226 Difference]: Without dead ends: 97 [2020-10-24 02:39:27,780 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-10-24 02:39:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-24 02:39:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2020-10-24 02:39:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 02:39:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2020-10-24 02:39:27,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 63 [2020-10-24 02:39:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:27,827 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2020-10-24 02:39:27,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2020-10-24 02:39:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 02:39:27,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:27,834 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, 1, 1, 1, 1] [2020-10-24 02:39:27,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:39:27,835 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash -486787275, now seen corresponding path program 1 times [2020-10-24 02:39:27,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:27,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038163540] [2020-10-24 02:39:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:28,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038163540] [2020-10-24 02:39:28,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:28,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:28,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272967663] [2020-10-24 02:39:28,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:28,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:28,040 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 6 states. [2020-10-24 02:39:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:28,647 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2020-10-24 02:39:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:28,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2020-10-24 02:39:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:28,649 INFO L225 Difference]: With dead ends: 123 [2020-10-24 02:39:28,649 INFO L226 Difference]: Without dead ends: 96 [2020-10-24 02:39:28,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-24 02:39:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2020-10-24 02:39:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-24 02:39:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-10-24 02:39:28,695 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 64 [2020-10-24 02:39:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:28,696 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-10-24 02:39:28,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-10-24 02:39:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 02:39:28,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:28,697 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, 1, 1, 1, 1] [2020-10-24 02:39:28,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:39:28,698 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash 240937836, now seen corresponding path program 1 times [2020-10-24 02:39:28,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:28,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180477097] [2020-10-24 02:39:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:29,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:29,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:29,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:29,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180477097] [2020-10-24 02:39:29,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:29,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:29,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499735408] [2020-10-24 02:39:29,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:29,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:29,335 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 11 states. [2020-10-24 02:39:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:44,140 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2020-10-24 02:39:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:44,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-24 02:39:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:44,142 INFO L225 Difference]: With dead ends: 122 [2020-10-24 02:39:44,142 INFO L226 Difference]: Without dead ends: 95 [2020-10-24 02:39:44,144 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-10-24 02:39:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-24 02:39:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2020-10-24 02:39:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-24 02:39:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2020-10-24 02:39:44,194 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 65 [2020-10-24 02:39:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:44,194 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2020-10-24 02:39:44,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2020-10-24 02:39:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 02:39:44,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:44,196 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, 1, 1, 1, 1] [2020-10-24 02:39:44,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:39:44,196 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1939332709, now seen corresponding path program 1 times [2020-10-24 02:39:44,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:44,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319549642] [2020-10-24 02:39:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:44,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319549642] [2020-10-24 02:39:44,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:44,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:44,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308369629] [2020-10-24 02:39:44,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:44,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:44,403 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 6 states. [2020-10-24 02:39:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:44,981 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2020-10-24 02:39:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:44,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-10-24 02:39:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:44,984 INFO L225 Difference]: With dead ends: 121 [2020-10-24 02:39:44,984 INFO L226 Difference]: Without dead ends: 94 [2020-10-24 02:39:44,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-24 02:39:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2020-10-24 02:39:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 02:39:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-10-24 02:39:45,026 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 66 [2020-10-24 02:39:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:45,026 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-10-24 02:39:45,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-10-24 02:39:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 02:39:45,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:45,027 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, 1, 1, 1, 1] [2020-10-24 02:39:45,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:39:45,028 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 221811922, now seen corresponding path program 1 times [2020-10-24 02:39:45,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:45,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117423271] [2020-10-24 02:39:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:45,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117423271] [2020-10-24 02:39:45,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:45,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:45,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290292740] [2020-10-24 02:39:45,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:45,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:45,171 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 6 states. [2020-10-24 02:39:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:45,679 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2020-10-24 02:39:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:45,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-10-24 02:39:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:45,682 INFO L225 Difference]: With dead ends: 120 [2020-10-24 02:39:45,682 INFO L226 Difference]: Without dead ends: 93 [2020-10-24 02:39:45,683 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-10-24 02:39:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-24 02:39:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-10-24 02:39:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 02:39:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-10-24 02:39:45,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 67 [2020-10-24 02:39:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:45,743 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-10-24 02:39:45,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-10-24 02:39:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 02:39:45,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:45,744 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:45,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:39:45,745 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -472126463, now seen corresponding path program 1 times [2020-10-24 02:39:45,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:45,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53092743] [2020-10-24 02:39:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:39:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:39:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:46,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53092743] [2020-10-24 02:39:46,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:46,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:46,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655096773] [2020-10-24 02:39:46,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:46,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:46,313 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 11 states. [2020-10-24 02:40:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:26,442 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2020-10-24 02:40:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:40:26,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-10-24 02:40:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:26,444 INFO L225 Difference]: With dead ends: 119 [2020-10-24 02:40:26,444 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 02:40:26,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:40:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 02:40:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2020-10-24 02:40:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-24 02:40:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2020-10-24 02:40:26,486 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 68 [2020-10-24 02:40:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:26,487 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2020-10-24 02:40:26,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:40:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2020-10-24 02:40:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-24 02:40:26,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:26,488 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:26,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:40:26,488 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 520674872, now seen corresponding path program 1 times [2020-10-24 02:40:26,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:26,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015513055] [2020-10-24 02:40:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:27,095 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2020-10-24 02:40:27,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:27,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:27,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:40:27,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015513055] [2020-10-24 02:40:27,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:27,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 02:40:27,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374500057] [2020-10-24 02:40:27,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 02:40:27,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:27,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 02:40:27,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-10-24 02:40:27,208 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 21 states. [2020-10-24 02:40:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:29,227 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2020-10-24 02:40:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:40:29,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2020-10-24 02:40:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:29,230 INFO L225 Difference]: With dead ends: 155 [2020-10-24 02:40:29,230 INFO L226 Difference]: Without dead ends: 152 [2020-10-24 02:40:29,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 02:40:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-24 02:40:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2020-10-24 02:40:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-24 02:40:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2020-10-24 02:40:29,304 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 69 [2020-10-24 02:40:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:29,304 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2020-10-24 02:40:29,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 02:40:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2020-10-24 02:40:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 02:40:29,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:29,309 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:29,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:40:29,309 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 232003341, now seen corresponding path program 2 times [2020-10-24 02:40:29,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:29,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536849515] [2020-10-24 02:40:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:29,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:29,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:29,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:29,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:29,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536849515] [2020-10-24 02:40:29,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:29,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:40:29,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329072758] [2020-10-24 02:40:29,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:40:29,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:40:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:29,813 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 11 states. [2020-10-24 02:40:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:31,244 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2020-10-24 02:40:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:40:31,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-10-24 02:40:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:31,246 INFO L225 Difference]: With dead ends: 161 [2020-10-24 02:40:31,246 INFO L226 Difference]: Without dead ends: 114 [2020-10-24 02:40:31,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:40:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-24 02:40:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2020-10-24 02:40:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-24 02:40:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2020-10-24 02:40:31,299 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 78 [2020-10-24 02:40:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:31,299 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2020-10-24 02:40:31,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:40:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-10-24 02:40:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 02:40:31,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:31,301 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2020-10-24 02:40:31,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:40:31,301 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1011499128, now seen corresponding path program 1 times [2020-10-24 02:40:31,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:31,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138695674] [2020-10-24 02:40:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:31,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:31,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:31,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:31,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:31,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138695674] [2020-10-24 02:40:31,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:31,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:31,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576975929] [2020-10-24 02:40:31,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:31,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:31,464 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 7 states. [2020-10-24 02:40:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:32,156 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2020-10-24 02:40:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:40:32,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-10-24 02:40:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:32,159 INFO L225 Difference]: With dead ends: 140 [2020-10-24 02:40:32,159 INFO L226 Difference]: Without dead ends: 113 [2020-10-24 02:40:32,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-24 02:40:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-24 02:40:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-24 02:40:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2020-10-24 02:40:32,228 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 79 [2020-10-24 02:40:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:32,228 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2020-10-24 02:40:32,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2020-10-24 02:40:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-24 02:40:32,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:32,229 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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, 1] [2020-10-24 02:40:32,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 02:40:32,230 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash 124684787, now seen corresponding path program 1 times [2020-10-24 02:40:32,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:32,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147766381] [2020-10-24 02:40:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:32,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:32,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:32,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:32,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:32,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147766381] [2020-10-24 02:40:32,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:32,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:32,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109909884] [2020-10-24 02:40:32,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:32,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:32,479 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 7 states. [2020-10-24 02:40:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:33,246 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2020-10-24 02:40:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:40:33,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2020-10-24 02:40:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:33,248 INFO L225 Difference]: With dead ends: 139 [2020-10-24 02:40:33,248 INFO L226 Difference]: Without dead ends: 112 [2020-10-24 02:40:33,249 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-10-24 02:40:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-24 02:40:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2020-10-24 02:40:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-24 02:40:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2020-10-24 02:40:33,304 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 80 [2020-10-24 02:40:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:33,304 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2020-10-24 02:40:33,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2020-10-24 02:40:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 02:40:33,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:33,306 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:33,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 02:40:33,306 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2016702574, now seen corresponding path program 1 times [2020-10-24 02:40:33,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:33,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292729777] [2020-10-24 02:40:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:35,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:35,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:35,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:35,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:35,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292729777] [2020-10-24 02:40:35,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:35,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:35,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984837133] [2020-10-24 02:40:35,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:35,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2020-10-24 02:40:35,566 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 7 states. [2020-10-24 02:40:37,869 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 59 [2020-10-24 02:40:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:55,202 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2020-10-24 02:40:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:40:55,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-10-24 02:40:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:55,208 INFO L225 Difference]: With dead ends: 162 [2020-10-24 02:40:55,208 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 02:40:55,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=39, Invalid=92, Unknown=1, NotChecked=0, Total=132 [2020-10-24 02:40:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 02:40:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2020-10-24 02:40:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-24 02:40:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2020-10-24 02:40:55,300 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 81 [2020-10-24 02:40:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:55,300 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2020-10-24 02:40:55,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2020-10-24 02:40:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-24 02:40:55,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:55,302 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1] [2020-10-24 02:40:55,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 02:40:55,302 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1569766617, now seen corresponding path program 1 times [2020-10-24 02:40:55,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:55,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525727318] [2020-10-24 02:40:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:55,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525727318] [2020-10-24 02:40:55,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:55,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:55,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177888313] [2020-10-24 02:40:55,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:55,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:55,544 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 7 states. [2020-10-24 02:40:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:56,342 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2020-10-24 02:40:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:40:56,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2020-10-24 02:40:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:56,344 INFO L225 Difference]: With dead ends: 201 [2020-10-24 02:40:56,345 INFO L226 Difference]: Without dead ends: 142 [2020-10-24 02:40:56,345 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-10-24 02:40:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-24 02:40:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2020-10-24 02:40:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 02:40:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2020-10-24 02:40:56,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 82 [2020-10-24 02:40:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:56,456 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2020-10-24 02:40:56,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2020-10-24 02:40:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-24 02:40:56,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:56,457 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:56,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 02:40:56,458 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1629708628, now seen corresponding path program 1 times [2020-10-24 02:40:56,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:56,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110740776] [2020-10-24 02:40:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:56,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110740776] [2020-10-24 02:40:56,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:56,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:56,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545130454] [2020-10-24 02:40:56,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:56,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:56,622 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 7 states. [2020-10-24 02:40:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:57,320 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2020-10-24 02:40:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:40:57,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2020-10-24 02:40:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:57,323 INFO L225 Difference]: With dead ends: 197 [2020-10-24 02:40:57,323 INFO L226 Difference]: Without dead ends: 138 [2020-10-24 02:40:57,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-24 02:40:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-10-24 02:40:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-24 02:40:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2020-10-24 02:40:57,437 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 83 [2020-10-24 02:40:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:57,437 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2020-10-24 02:40:57,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2020-10-24 02:40:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-24 02:40:57,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:57,438 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1] [2020-10-24 02:40:57,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 02:40:57,439 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash 222998463, now seen corresponding path program 1 times [2020-10-24 02:40:57,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:57,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570800423] [2020-10-24 02:40:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:58,176 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-10-24 02:40:58,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:58,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:40:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:58,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:40:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:58,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:40:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:58,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570800423] [2020-10-24 02:40:58,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:58,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 02:40:58,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813792850] [2020-10-24 02:40:58,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 02:40:58,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 02:40:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2020-10-24 02:40:58,311 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand 23 states. [2020-10-24 02:41:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:00,761 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2020-10-24 02:41:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 02:41:00,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2020-10-24 02:41:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:00,764 INFO L225 Difference]: With dead ends: 163 [2020-10-24 02:41:00,764 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 02:41:00,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 02:41:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 02:41:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2020-10-24 02:41:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-10-24 02:41:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 165 transitions. [2020-10-24 02:41:00,857 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 165 transitions. Word has length 84 [2020-10-24 02:41:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:00,857 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 165 transitions. [2020-10-24 02:41:00,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 02:41:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2020-10-24 02:41:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-24 02:41:00,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:00,858 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 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-10-24 02:41:00,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 02:41:00,859 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1623723366, now seen corresponding path program 2 times [2020-10-24 02:41:00,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:00,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009850676] [2020-10-24 02:41:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:41:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:41:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:41:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:41:01,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009850676] [2020-10-24 02:41:01,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:01,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:41:01,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768406830] [2020-10-24 02:41:01,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:41:01,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:41:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:41:01,504 INFO L87 Difference]: Start difference. First operand 143 states and 165 transitions. Second operand 12 states. [2020-10-24 02:41:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:03,133 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2020-10-24 02:41:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:41:03,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2020-10-24 02:41:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:03,136 INFO L225 Difference]: With dead ends: 220 [2020-10-24 02:41:03,136 INFO L226 Difference]: Without dead ends: 161 [2020-10-24 02:41:03,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:41:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-24 02:41:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2020-10-24 02:41:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-24 02:41:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2020-10-24 02:41:03,226 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 93 [2020-10-24 02:41:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:03,227 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2020-10-24 02:41:03,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:41:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2020-10-24 02:41:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-24 02:41:03,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:03,228 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2020-10-24 02:41:03,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 02:41:03,228 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash -817851313, now seen corresponding path program 1 times [2020-10-24 02:41:03,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:03,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [154687476] [2020-10-24 02:41:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:41:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:41:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:41:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:41:03,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [154687476] [2020-10-24 02:41:03,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:03,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:41:03,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731712645] [2020-10-24 02:41:03,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:41:03,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:03,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:41:03,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:41:03,412 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 8 states. [2020-10-24 02:41:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:04,347 INFO L93 Difference]: Finished difference Result 219 states and 269 transitions. [2020-10-24 02:41:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:41:04,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2020-10-24 02:41:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:04,350 INFO L225 Difference]: With dead ends: 219 [2020-10-24 02:41:04,350 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 02:41:04,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:41:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 02:41:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-10-24 02:41:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-24 02:41:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2020-10-24 02:41:04,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 94 [2020-10-24 02:41:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:04,430 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2020-10-24 02:41:04,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:41:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2020-10-24 02:41:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-24 02:41:04,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:04,431 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2020-10-24 02:41:04,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 02:41:04,431 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1832799756, now seen corresponding path program 1 times [2020-10-24 02:41:04,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:04,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064562769] [2020-10-24 02:41:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:41:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:41:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:41:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:41:04,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064562769] [2020-10-24 02:41:04,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:04,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:41:04,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258277786] [2020-10-24 02:41:04,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:41:04,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:41:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:41:04,746 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand 8 states. [2020-10-24 02:41:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:05,689 INFO L93 Difference]: Finished difference Result 218 states and 267 transitions. [2020-10-24 02:41:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:41:05,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2020-10-24 02:41:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:05,691 INFO L225 Difference]: With dead ends: 218 [2020-10-24 02:41:05,691 INFO L226 Difference]: Without dead ends: 159 [2020-10-24 02:41:05,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:41:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-24 02:41:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2020-10-24 02:41:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-24 02:41:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2020-10-24 02:41:05,821 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 95 [2020-10-24 02:41:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:05,821 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2020-10-24 02:41:05,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:41:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2020-10-24 02:41:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-24 02:41:05,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:05,823 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1] [2020-10-24 02:41:05,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-24 02:41:05,823 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash -866308235, now seen corresponding path program 1 times [2020-10-24 02:41:05,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:05,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626836776] [2020-10-24 02:41:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:41:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:41:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:41:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:41:08,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626836776] [2020-10-24 02:41:08,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:08,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:41:08,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825397756] [2020-10-24 02:41:08,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:41:08,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:41:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=126, Unknown=1, NotChecked=0, Total=156 [2020-10-24 02:41:08,616 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 13 states. [2020-10-24 02:41:11,148 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string5.offset| |c_old(#t~string5.offset)|) (= |c_old(#length)| |c_#length|) (= |c_#t~string6.base| |c_old(#t~string6.base)|) (= c_~SIZE~0 |c_old(~SIZE~0)|) (= |c_#t~string6.offset| |c_old(#t~string6.offset)|) (= |c_#t~string4.offset| |c_old(#t~string4.offset)|) (= |c_old(#valid)| |c_#valid|) (<= (+ (* 4294967295 c_main_~l~0) c_main_~n~0) (+ (* 4294967296 (div c_main_~n~0 4294967296)) (* 12884901888 (div (+ (* c_main_~l~0 1431655765) (- 1431655765)) 4294967296)) 4314967296)) (<= c_~SIZE~0 20000001) (= |c_#t~string5.base| |c_old(#t~string5.base)|) (<= (let ((.cse2 (div c_main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ c_main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ c_main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) c_main_~l~0) (= |c_#t~string4.base| |c_old(#t~string4.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (<= 20000001 c_~SIZE~0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2020-10-24 02:41:22,146 WARN L193 SmtUtils]: Spent 8.61 s on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-10-24 02:41:40,923 WARN L193 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 78 [2020-10-24 02:41:47,983 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_main_~l~0 4294967296))) (let ((.cse5 (* .cse2 (- 4294967296)))) (let ((.cse1 (div (+ c_main_~l~0 .cse5) 6))) (let ((.cse4 (* 4294967296 (div c_main_~n~0 4294967296))) (.cse0 (div (+ c_main_~l~0 (* .cse1 (- 6)) .cse5) 4294967296)) (.cse3 (* 4294967296 .cse2))) (and (= |c_#t~string5.offset| |c_old(#t~string5.offset)|) (or (<= (+ (* 6148914694099828736 .cse0) (* 8589934592 .cse1) (* 6148914689804861440 .cse2) 1431655764) (* 1431655765 c_main_~l~0)) (<= (+ c_main_~n~0 .cse3 4274967299) (+ .cse4 c_main_~l~0))) (= |c_old(#length)| |c_#length|) (= |c_#t~string6.base| |c_old(#t~string6.base)|) (= c_~SIZE~0 |c_old(~SIZE~0)|) (= |c_#t~string6.offset| |c_old(#t~string6.offset)|) (= |c_#t~string4.offset| |c_old(#t~string4.offset)|) (= |c_old(#valid)| |c_#valid|) (<= (+ (* 4294967295 c_main_~l~0) c_main_~n~0) (+ .cse4 (* 12884901888 (div (+ (* c_main_~l~0 1431655765) (- 2863311530)) 4294967296)) 8609934591)) (= |c_#t~string5.base| |c_old(#t~string5.base)|) (<= (+ (* 4294967298 .cse0) (* 6 .cse1) .cse3 1) c_main_~l~0) (= |c_#t~string4.base| |c_old(#t~string4.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))))) is different from false [2020-10-24 02:41:59,439 WARN L193 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 69 [2020-10-24 02:42:04,360 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-24 02:42:12,222 WARN L193 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-10-24 02:42:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:21,278 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2020-10-24 02:42:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:42:21,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-10-24 02:42:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:21,280 INFO L225 Difference]: With dead ends: 213 [2020-10-24 02:42:21,280 INFO L226 Difference]: Without dead ends: 154 [2020-10-24 02:42:21,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=123, Invalid=531, Unknown=4, NotChecked=98, Total=756 [2020-10-24 02:42:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-24 02:42:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2020-10-24 02:42:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-24 02:42:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2020-10-24 02:42:21,383 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 96 [2020-10-24 02:42:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:21,383 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2020-10-24 02:42:21,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:42:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2020-10-24 02:42:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 02:42:21,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:21,384 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1] [2020-10-24 02:42:21,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-24 02:42:21,385 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1904222542, now seen corresponding path program 1 times [2020-10-24 02:42:21,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:21,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775753704] [2020-10-24 02:42:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:42:22,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775753704] [2020-10-24 02:42:22,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:22,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:42:22,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775625949] [2020-10-24 02:42:22,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:42:22,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:42:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:42:22,163 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 12 states. [2020-10-24 02:42:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:23,655 INFO L93 Difference]: Finished difference Result 211 states and 257 transitions. [2020-10-24 02:42:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:42:23,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2020-10-24 02:42:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:23,657 INFO L225 Difference]: With dead ends: 211 [2020-10-24 02:42:23,657 INFO L226 Difference]: Without dead ends: 152 [2020-10-24 02:42:23,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:42:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-24 02:42:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-10-24 02:42:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-24 02:42:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2020-10-24 02:42:23,748 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 97 [2020-10-24 02:42:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:23,748 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2020-10-24 02:42:23,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2020-10-24 02:42:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-24 02:42:23,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:23,749 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1] [2020-10-24 02:42:23,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-24 02:42:23,750 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1310227099, now seen corresponding path program 1 times [2020-10-24 02:42:23,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:23,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281182357] [2020-10-24 02:42:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:42:24,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281182357] [2020-10-24 02:42:24,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:24,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 02:42:24,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229567891] [2020-10-24 02:42:24,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 02:42:24,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 02:42:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2020-10-24 02:42:24,672 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 25 states. [2020-10-24 02:42:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:27,162 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2020-10-24 02:42:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 02:42:27,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2020-10-24 02:42:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:27,164 INFO L225 Difference]: With dead ends: 175 [2020-10-24 02:42:27,164 INFO L226 Difference]: Without dead ends: 172 [2020-10-24 02:42:27,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=400, Invalid=1856, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 02:42:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-24 02:42:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 157. [2020-10-24 02:42:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-24 02:42:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2020-10-24 02:42:27,306 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 98 [2020-10-24 02:42:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:27,306 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2020-10-24 02:42:27,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 02:42:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2020-10-24 02:42:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-10-24 02:42:27,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:27,307 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1] [2020-10-24 02:42:27,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-24 02:42:27,308 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1728398838, now seen corresponding path program 2 times [2020-10-24 02:42:27,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:27,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15496194] [2020-10-24 02:42:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:42:27,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15496194] [2020-10-24 02:42:27,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:27,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:42:27,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468334679] [2020-10-24 02:42:27,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:42:27,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:42:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:42:27,672 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand 9 states. [2020-10-24 02:42:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:28,804 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2020-10-24 02:42:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:42:28,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2020-10-24 02:42:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:28,807 INFO L225 Difference]: With dead ends: 232 [2020-10-24 02:42:28,807 INFO L226 Difference]: Without dead ends: 173 [2020-10-24 02:42:28,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:42:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-24 02:42:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2020-10-24 02:42:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-24 02:42:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2020-10-24 02:42:28,907 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 107 [2020-10-24 02:42:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:28,908 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2020-10-24 02:42:28,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:42:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2020-10-24 02:42:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-24 02:42:28,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:28,909 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2020-10-24 02:42:28,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-24 02:42:28,909 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:28,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1668833712, now seen corresponding path program 1 times [2020-10-24 02:42:28,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:28,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612519814] [2020-10-24 02:42:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:42:29,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612519814] [2020-10-24 02:42:29,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:29,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:42:29,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583020228] [2020-10-24 02:42:29,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:42:29,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:42:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:42:29,236 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand 9 states. [2020-10-24 02:42:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:30,311 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2020-10-24 02:42:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:42:30,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-10-24 02:42:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:30,313 INFO L225 Difference]: With dead ends: 229 [2020-10-24 02:42:30,313 INFO L226 Difference]: Without dead ends: 170 [2020-10-24 02:42:30,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:42:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-24 02:42:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2020-10-24 02:42:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-24 02:42:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2020-10-24 02:42:30,435 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 109 [2020-10-24 02:42:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:30,436 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2020-10-24 02:42:30,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:42:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2020-10-24 02:42:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-24 02:42:30,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:30,437 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1] [2020-10-24 02:42:30,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-24 02:42:30,437 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash -561800874, now seen corresponding path program 1 times [2020-10-24 02:42:30,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:30,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552361881] [2020-10-24 02:42:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 10 proven. 110 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:42:31,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552361881] [2020-10-24 02:42:31,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:31,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 02:42:31,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475253129] [2020-10-24 02:42:31,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 02:42:31,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 02:42:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-10-24 02:42:31,442 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand 27 states. [2020-10-24 02:42:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:38,697 INFO L93 Difference]: Finished difference Result 275 states and 343 transitions. [2020-10-24 02:42:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 02:42:38,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 111 [2020-10-24 02:42:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:38,700 INFO L225 Difference]: With dead ends: 275 [2020-10-24 02:42:38,700 INFO L226 Difference]: Without dead ends: 272 [2020-10-24 02:42:38,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=445, Invalid=2207, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 02:42:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-24 02:42:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 219. [2020-10-24 02:42:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-24 02:42:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 267 transitions. [2020-10-24 02:42:38,864 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 267 transitions. Word has length 111 [2020-10-24 02:42:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:38,864 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 267 transitions. [2020-10-24 02:42:38,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 02:42:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 267 transitions. [2020-10-24 02:42:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-10-24 02:42:38,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:38,865 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1] [2020-10-24 02:42:38,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-24 02:42:38,865 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1574370735, now seen corresponding path program 2 times [2020-10-24 02:42:38,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:38,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042427692] [2020-10-24 02:42:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 25 proven. 122 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:42:39,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042427692] [2020-10-24 02:42:39,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:39,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:42:39,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896144644] [2020-10-24 02:42:39,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:42:39,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:42:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:42:39,247 INFO L87 Difference]: Start difference. First operand 219 states and 267 transitions. Second operand 10 states. [2020-10-24 02:42:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:40,600 INFO L93 Difference]: Finished difference Result 302 states and 379 transitions. [2020-10-24 02:42:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:42:40,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2020-10-24 02:42:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:40,602 INFO L225 Difference]: With dead ends: 302 [2020-10-24 02:42:40,602 INFO L226 Difference]: Without dead ends: 187 [2020-10-24 02:42:40,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:42:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-24 02:42:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2020-10-24 02:42:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-24 02:42:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2020-10-24 02:42:40,708 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 120 [2020-10-24 02:42:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:40,708 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2020-10-24 02:42:40,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:42:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2020-10-24 02:42:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-24 02:42:40,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:40,710 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2020-10-24 02:42:40,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-24 02:42:40,710 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1947184422, now seen corresponding path program 1 times [2020-10-24 02:42:40,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:40,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046606868] [2020-10-24 02:42:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 24 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:42:40,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046606868] [2020-10-24 02:42:40,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:40,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:42:40,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678527761] [2020-10-24 02:42:40,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:42:40,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:42:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:42:40,959 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand 10 states. [2020-10-24 02:42:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:42,227 INFO L93 Difference]: Finished difference Result 244 states and 293 transitions. [2020-10-24 02:42:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:42:42,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 121 [2020-10-24 02:42:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:42,229 INFO L225 Difference]: With dead ends: 244 [2020-10-24 02:42:42,230 INFO L226 Difference]: Without dead ends: 185 [2020-10-24 02:42:42,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:42:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-24 02:42:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-10-24 02:42:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-24 02:42:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2020-10-24 02:42:42,394 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 121 [2020-10-24 02:42:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:42,394 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2020-10-24 02:42:42,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:42:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2020-10-24 02:42:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-24 02:42:42,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:42,396 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2020-10-24 02:42:42,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-24 02:42:42,396 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1649561621, now seen corresponding path program 1 times [2020-10-24 02:42:42,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:42,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037678368] [2020-10-24 02:42:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 24 proven. 132 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:42:42,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037678368] [2020-10-24 02:42:42,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:42,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:42:42,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784116745] [2020-10-24 02:42:42,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:42:42,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:42:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:42:42,823 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 10 states. [2020-10-24 02:42:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:44,136 INFO L93 Difference]: Finished difference Result 238 states and 284 transitions. [2020-10-24 02:42:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:42:44,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2020-10-24 02:42:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:44,139 INFO L225 Difference]: With dead ends: 238 [2020-10-24 02:42:44,139 INFO L226 Difference]: Without dead ends: 177 [2020-10-24 02:42:44,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:42:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-24 02:42:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2020-10-24 02:42:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-24 02:42:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2020-10-24 02:42:44,246 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 122 [2020-10-24 02:42:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:44,247 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2020-10-24 02:42:44,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:42:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2020-10-24 02:42:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-10-24 02:42:44,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:44,248 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 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, 1, 1] [2020-10-24 02:42:44,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-24 02:42:44,249 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2043244172, now seen corresponding path program 1 times [2020-10-24 02:42:44,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:44,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827699178] [2020-10-24 02:42:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 12 proven. 149 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:42:45,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827699178] [2020-10-24 02:42:45,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:45,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 02:42:45,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232262289] [2020-10-24 02:42:45,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 02:42:45,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 02:42:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-10-24 02:42:45,502 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand 29 states. [2020-10-24 02:42:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:48,774 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2020-10-24 02:42:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 02:42:48,775 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 123 [2020-10-24 02:42:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:48,776 INFO L225 Difference]: With dead ends: 200 [2020-10-24 02:42:48,776 INFO L226 Difference]: Without dead ends: 197 [2020-10-24 02:42:48,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=496, Invalid=2584, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 02:42:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-24 02:42:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2020-10-24 02:42:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-24 02:42:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 204 transitions. [2020-10-24 02:42:48,896 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 204 transitions. Word has length 123 [2020-10-24 02:42:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:48,897 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 204 transitions. [2020-10-24 02:42:48,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 02:42:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 204 transitions. [2020-10-24 02:42:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 02:42:48,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:48,898 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 6, 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, 1, 1] [2020-10-24 02:42:48,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-24 02:42:48,898 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1120838969, now seen corresponding path program 2 times [2020-10-24 02:42:48,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:48,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [400464495] [2020-10-24 02:42:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 02:42:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 29 proven. 163 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:42:49,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [400464495] [2020-10-24 02:42:49,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:49,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:42:49,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028347606] [2020-10-24 02:42:49,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:42:49,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:42:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:42:49,303 INFO L87 Difference]: Start difference. First operand 182 states and 204 transitions. Second operand 11 states. [2020-10-24 02:42:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:50,859 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2020-10-24 02:42:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:42:50,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-10-24 02:42:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:50,864 INFO L225 Difference]: With dead ends: 255 [2020-10-24 02:42:50,864 INFO L226 Difference]: Without dead ends: 196 [2020-10-24 02:42:50,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:42:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-24 02:42:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2020-10-24 02:42:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-24 02:42:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2020-10-24 02:42:51,001 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 132 [2020-10-24 02:42:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:51,001 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2020-10-24 02:42:51,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:42:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2020-10-24 02:42:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 02:42:51,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:51,003 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1] [2020-10-24 02:42:51,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-24 02:42:51,003 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -402768609, now seen corresponding path program 1 times [2020-10-24 02:42:51,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:51,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580319580] [2020-10-24 02:42:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:42:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:42:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:42:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:42:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:42:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 02:42:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 189 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:42:52,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580319580] [2020-10-24 02:42:52,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:52,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-10-24 02:42:52,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912903218] [2020-10-24 02:42:52,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-24 02:42:52,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-24 02:42:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2020-10-24 02:42:52,442 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand 31 states. [2020-10-24 02:42:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:59,888 INFO L93 Difference]: Finished difference Result 291 states and 356 transitions. [2020-10-24 02:42:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-24 02:42:59,889 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 134 [2020-10-24 02:42:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:59,891 INFO L225 Difference]: With dead ends: 291 [2020-10-24 02:42:59,891 INFO L226 Difference]: Without dead ends: 288 [2020-10-24 02:42:59,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2020-10-24 02:42:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-24 02:43:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2020-10-24 02:43:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-24 02:43:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 299 transitions. [2020-10-24 02:43:00,094 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 299 transitions. Word has length 134 [2020-10-24 02:43:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:00,095 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 299 transitions. [2020-10-24 02:43:00,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-24 02:43:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 299 transitions. [2020-10-24 02:43:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-24 02:43:00,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:00,096 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 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, 1, 1, 1, 1] [2020-10-24 02:43:00,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-24 02:43:00,096 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -296907770, now seen corresponding path program 2 times [2020-10-24 02:43:00,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:00,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777380574] [2020-10-24 02:43:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:43:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:43:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:43:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:43:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:43:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:43:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 02:43:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 02:43:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 33 proven. 205 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-24 02:43:00,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777380574] [2020-10-24 02:43:00,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:43:00,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:43:00,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366571801] [2020-10-24 02:43:00,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:43:00,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:43:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:43:00,747 INFO L87 Difference]: Start difference. First operand 250 states and 299 transitions. Second operand 12 states. [2020-10-24 02:43:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:43:02,764 INFO L93 Difference]: Finished difference Result 321 states and 394 transitions. [2020-10-24 02:43:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:43:02,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-10-24 02:43:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:43:02,766 INFO L225 Difference]: With dead ends: 321 [2020-10-24 02:43:02,766 INFO L226 Difference]: Without dead ends: 198 [2020-10-24 02:43:02,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-10-24 02:43:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-24 02:43:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2020-10-24 02:43:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-24 02:43:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2020-10-24 02:43:02,883 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 143 [2020-10-24 02:43:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:02,883 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2020-10-24 02:43:02,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:43:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2020-10-24 02:43:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 02:43:02,885 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:02,885 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1] [2020-10-24 02:43:02,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-24 02:43:02,885 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash -227874385, now seen corresponding path program 1 times [2020-10-24 02:43:02,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:02,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272094837] [2020-10-24 02:43:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:43:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:43:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:43:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:43:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:43:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:43:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 02:43:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 02:43:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 16 proven. 228 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-24 02:43:04,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272094837] [2020-10-24 02:43:04,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:43:04,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-10-24 02:43:04,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825284910] [2020-10-24 02:43:04,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-10-24 02:43:04,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-10-24 02:43:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 02:43:04,308 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand 33 states. [2020-10-24 02:43:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:43:07,997 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2020-10-24 02:43:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-24 02:43:07,998 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 144 [2020-10-24 02:43:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:43:07,999 INFO L225 Difference]: With dead ends: 221 [2020-10-24 02:43:07,999 INFO L226 Difference]: Without dead ends: 218 [2020-10-24 02:43:08,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=616, Invalid=3416, Unknown=0, NotChecked=0, Total=4032 [2020-10-24 02:43:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-24 02:43:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 203. [2020-10-24 02:43:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 02:43:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2020-10-24 02:43:08,139 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 144 [2020-10-24 02:43:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:08,140 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2020-10-24 02:43:08,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-10-24 02:43:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2020-10-24 02:43:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-24 02:43:08,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:08,141 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1] [2020-10-24 02:43:08,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-24 02:43:08,141 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1632501386, now seen corresponding path program 2 times [2020-10-24 02:43:08,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:08,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [764577885] [2020-10-24 02:43:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:43:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-24 02:43:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:43:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:43:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-24 02:43:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:43:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-24 02:43:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 02:43:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 02:43:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-10-24 02:43:09,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [764577885] [2020-10-24 02:43:09,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:43:09,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-10-24 02:43:09,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439517115] [2020-10-24 02:43:09,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-10-24 02:43:09,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-10-24 02:43:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 02:43:09,568 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand 34 states. [2020-10-24 02:43:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:43:12,713 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2020-10-24 02:43:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-24 02:43:12,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 153 [2020-10-24 02:43:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:43:12,714 INFO L225 Difference]: With dead ends: 203 [2020-10-24 02:43:12,714 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:43:12,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=633, Invalid=3399, Unknown=0, NotChecked=0, Total=4032 [2020-10-24 02:43:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:43:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:43:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:43:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:43:12,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2020-10-24 02:43:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:12,717 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:43:12,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-10-24 02:43:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:43:12,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:43:12,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-24 02:43:12,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:43:13,346 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 384 [2020-10-24 02:43:14,293 WARN L193 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 250 [2020-10-24 02:43:14,992 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 385 [2020-10-24 02:43:15,538 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 305 [2020-10-24 02:43:16,240 WARN L193 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 437 DAG size of output: 348 [2020-10-24 02:43:17,268 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 506 DAG size of output: 374 [2020-10-24 02:43:17,423 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 130 [2020-10-24 02:43:18,111 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 427 DAG size of output: 365 [2020-10-24 02:43:18,383 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 134 [2020-10-24 02:43:18,606 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 389 [2020-10-24 02:43:19,008 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 183 [2020-10-24 02:43:19,270 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 380 [2020-10-24 02:43:19,611 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 273 [2020-10-24 02:43:19,771 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 424 DAG size of output: 385 [2020-10-24 02:43:20,123 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 353 [2020-10-24 02:43:20,713 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 348 [2020-10-24 02:43:20,974 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 164 [2020-10-24 02:43:21,391 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 231 [2020-10-24 02:43:23,567 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 364 DAG size of output: 21 [2020-10-24 02:43:28,715 WARN L193 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 233 DAG size of output: 39 [2020-10-24 02:43:30,417 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 370 DAG size of output: 21 [2020-10-24 02:43:40,760 WARN L193 SmtUtils]: Spent 10.34 s on a formula simplification. DAG size of input: 290 DAG size of output: 59 [2020-10-24 02:43:45,014 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 331 DAG size of output: 50 [2020-10-24 02:43:48,551 WARN L193 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 354 DAG size of output: 23 [2020-10-24 02:43:48,782 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 21 [2020-10-24 02:44:01,065 WARN L193 SmtUtils]: Spent 12.28 s on a formula simplification. DAG size of input: 346 DAG size of output: 51 [2020-10-24 02:44:01,178 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-10-24 02:44:01,296 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-10-24 02:44:01,424 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-10-24 02:44:01,855 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 21 [2020-10-24 02:44:04,173 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 371 DAG size of output: 21 [2020-10-24 02:44:05,260 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 170 DAG size of output: 39 [2020-10-24 02:44:07,831 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 360 DAG size of output: 21 [2020-10-24 02:44:18,405 WARN L193 SmtUtils]: Spent 10.57 s on a formula simplification. DAG size of input: 262 DAG size of output: 59 [2020-10-24 02:44:21,123 WARN L193 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 367 DAG size of output: 21 [2020-10-24 02:44:21,231 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-10-24 02:44:22,433 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 334 DAG size of output: 39 [2020-10-24 02:44:22,826 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 21 [2020-10-24 02:44:23,022 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 21 [2020-10-24 02:44:26,446 WARN L193 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 329 DAG size of output: 50 [2020-10-24 02:44:27,411 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 21 [2020-10-24 02:44:30,923 WARN L193 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 220 DAG size of output: 39 [2020-10-24 02:44:30,929 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,929 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,930 INFO L270 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:44:30,930 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~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-10-24 02:44:30,930 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,931 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 02:44:30,931 INFO L270 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:44:30,931 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:44:30,931 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:44:30,931 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:44:30,931 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:44:30,931 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:44:30,931 INFO L274 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-10-24 02:44:30,931 INFO L274 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-10-24 02:44:30,931 INFO L274 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:44:30,931 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:44:30,931 INFO L270 CegarLoopResult]: At program point L31(lines 31 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L27(lines 27 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 16 45) the Hoare annotation is: true [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L23(lines 23 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,932 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse1 (- 5)) .cse2) 4294967296)) (* 5 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,933 INFO L270 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,933 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,933 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,933 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,933 INFO L270 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,934 INFO L270 CegarLoopResult]: At program point L37(lines 37 40) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0)))))) [2020-10-24 02:44:30,934 INFO L270 CegarLoopResult]: At program point L37-2(lines 23 40) the Hoare annotation is: (or (let ((.cse1 (+ main_~l~0 1)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,934 INFO L270 CegarLoopResult]: At program point L33(lines 33 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,934 INFO L270 CegarLoopResult]: At program point L29(lines 29 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,934 INFO L270 CegarLoopResult]: At program point L25(lines 25 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,934 INFO L277 CegarLoopResult]: At program point L21-2(lines 21 43) the Hoare annotation is: true [2020-10-24 02:44:30,934 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 02:44:30,934 INFO L270 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-10-24 02:44:30,934 INFO L270 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-10-24 02:44:30,935 INFO L270 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-10-24 02:44:30,935 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 16 45) the Hoare annotation is: true [2020-10-24 02:44:30,935 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,935 INFO L270 CegarLoopResult]: At program point L42-1(lines 21 43) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,935 INFO L270 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,935 INFO L270 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse1 (- 5)) .cse2) 4294967296)) (* 5 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,935 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,936 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 16 45) the Hoare annotation is: true [2020-10-24 02:44:30,936 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,936 INFO L270 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-10-24 02:44:30,936 INFO L270 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-10-24 02:44:30,936 INFO L270 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-10-24 02:44:30,936 INFO L270 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-10-24 02:44:30,936 INFO L270 CegarLoopResult]: At program point L18-4(line 18) 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-10-24 02:44:30,937 INFO L270 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~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-10-24 02:44:30,937 INFO L270 CegarLoopResult]: At program point L35(lines 35 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:44:30,937 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-10-24 02:44:30,937 INFO L270 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-10-24 02:44:30,937 INFO L270 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-10-24 02:44:30,937 INFO L270 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-10-24 02:44:30,938 INFO L270 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-10-24 02:44:30,938 INFO L270 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-10-24 02:44:30,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:44:30 BoogieIcfgContainer [2020-10-24 02:44:30,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:44:30,959 INFO L168 Benchmark]: Toolchain (without parser) took 337581.40 ms. Allocated memory was 151.0 MB in the beginning and 390.1 MB in the end (delta: 239.1 MB). Free memory was 126.9 MB in the beginning and 313.2 MB in the end (delta: -186.2 MB). Peak memory consumption was 237.9 MB. Max. memory is 8.0 GB. [2020-10-24 02:44:30,960 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:44:30,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.60 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 116.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:44:30,961 INFO L168 Benchmark]: Boogie Preprocessor took 42.36 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 114.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:44:30,961 INFO L168 Benchmark]: RCFGBuilder took 506.63 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 128.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:44:30,962 INFO L168 Benchmark]: TraceAbstraction took 336621.14 ms. Allocated memory was 151.0 MB in the beginning and 390.1 MB in the end (delta: 239.1 MB). Free memory was 128.3 MB in the beginning and 313.7 MB in the end (delta: -185.4 MB). Peak memory consumption was 238.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:44:30,963 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.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 394.60 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 116.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.36 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 114.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 506.63 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 128.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 336621.14 ms. Allocated memory was 151.0 MB in the beginning and 390.1 MB in the end (delta: 239.1 MB). Free memory was 128.3 MB in the beginning and 313.7 MB in the end (delta: -185.4 MB). Peak memory consumption was 238.4 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: ((l <= i + j + k + v1 + v2 + v3 + v4 + v5 + v6 && i + j + k + v1 + v2 + v3 + v4 + v5 + v6 <= l) || !(SIZE <= 20000001)) || !(20000001 <= SIZE) - 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, 69 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 258.3s, OverallIterations: 43, TraceHistogramMax: 10, AutomataDifference: 226.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 78.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1936 SDtfs, 8471 SDslu, 4226 SDs, 0 SdLazy, 18213 SolverSat, 1526 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 153.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 433 SyntacticMatches, 22 SemanticMatches, 905 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7550 ImplicationChecksByTransitivity, 77.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 714 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 64 LocationsWithAnnotation, 754 PreInvPairs, 929 NumberOfFragments, 1866 HoareAnnotationTreeSize, 754 FomulaSimplifications, 15221761812120 FormulaSimplificationTreeSizeReduction, 8.6s HoareSimplificationTime, 64 FomulaSimplificationsInter, 2590060984 FormulaSimplificationTreeSizeReductionInter, 69.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 3669 NumberOfCodeBlocks, 3669 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3626 ConstructedInterpolants, 0 QuantifiedInterpolants, 4061342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 1667/4230 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...