java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:45,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:45,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:45,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:45,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:45,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:45,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:45,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:45,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:45,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:45,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:45,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:45,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:45,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:45,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:45,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:45,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:45,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:45,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:45,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:45,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:45,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:45,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:45,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:45,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:45,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:45,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:45,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:45,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:45,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:45,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:45,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:45,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:45,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:45,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:45,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:45,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:45,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:45,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:45,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:45,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:45,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:00:45,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:45,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:45,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:45,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:45,997 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:45,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:45,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:45,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:45,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:45,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:45,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:45,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:45,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:45,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:45,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:45,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:45,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:46,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:46,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:46,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:46,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:46,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:46,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:46,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:46,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:46,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:46,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:46,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:46,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:46,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:46,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:46,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:46,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:46,047 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:46,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum5.i [2019-10-01 22:00:46,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e3cf24/242ef55d28334eaab321dfdee6ecaac9/FLAGa77895c83 [2019-10-01 22:00:46,542 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:46,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i [2019-10-01 22:00:46,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e3cf24/242ef55d28334eaab321dfdee6ecaac9/FLAGa77895c83 [2019-10-01 22:00:46,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76e3cf24/242ef55d28334eaab321dfdee6ecaac9 [2019-10-01 22:00:46,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:46,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:46,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:46,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:46,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:46,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:46" (1/1) ... [2019-10-01 22:00:46,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7354cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:46, skipping insertion in model container [2019-10-01 22:00:46,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:46" (1/1) ... [2019-10-01 22:00:46,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:47,016 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:47,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,263 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:47,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,398 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:47,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47 WrapperNode [2019-10-01 22:00:47,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:47,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:47,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:47,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:47,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:47,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:47,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:47,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:47,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:47,519 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-01 22:00:47,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:47,841 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:47,842 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:47,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:47 BoogieIcfgContainer [2019-10-01 22:00:47,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:47,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:47,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:47,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:47,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:46" (1/3) ... [2019-10-01 22:00:47,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b472ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:47, skipping insertion in model container [2019-10-01 22:00:47,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (2/3) ... [2019-10-01 22:00:47,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b472ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:47, skipping insertion in model container [2019-10-01 22:00:47,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:47" (3/3) ... [2019-10-01 22:00:47,857 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2019-10-01 22:00:47,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:47,879 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:47,895 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:47,928 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:47,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:47,929 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:47,929 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:47,929 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:47,929 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:47,929 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:47,929 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:47,929 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-01 22:00:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:00:47,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,951 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,953 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1089041636, now seen corresponding path program 1 times [2019-10-01 22:00:47,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:48,149 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-01 22:00:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,176 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-10-01 22:00:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:48,177 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-10-01 22:00:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,187 INFO L225 Difference]: With dead ends: 57 [2019-10-01 22:00:48,187 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 22:00:48,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 22:00:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-01 22:00:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:48,232 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2019-10-01 22:00:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,233 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:48,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:00:48,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,235 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,236 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1200270940, now seen corresponding path program 1 times [2019-10-01 22:00:48,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:48,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,382 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-10-01 22:00:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,435 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-10-01 22:00:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-01 22:00:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,438 INFO L225 Difference]: With dead ends: 47 [2019-10-01 22:00:48,438 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:48,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:48,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 33 [2019-10-01 22:00:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,447 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:48,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 22:00:48,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,449 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,450 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash 592534566, now seen corresponding path program 1 times [2019-10-01 22:00:48,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:00:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:48,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-01 22:00:48,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:00:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:00:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:00:48,791 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-10-01 22:00:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,924 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-10-01 22:00:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:48,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-10-01 22:00:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,927 INFO L225 Difference]: With dead ends: 51 [2019-10-01 22:00:48,927 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:00:48,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:00:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-01 22:00:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:48,936 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 35 [2019-10-01 22:00:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,937 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:48,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:00:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:00:48,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,939 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 22:00:48,939 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 476203942, now seen corresponding path program 1 times [2019-10-01 22:00:48,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-01 22:00:49,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:49,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 22:00:49,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:49,057 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-01 22:00:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,126 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-10-01 22:00:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:49,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-01 22:00:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,129 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:49,129 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:00:49,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:00:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 22:00:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:00:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-01 22:00:49,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 43 [2019-10-01 22:00:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,164 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-01 22:00:49,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-01 22:00:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:00:49,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,166 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 22:00:49,166 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash -106794812, now seen corresponding path program 1 times [2019-10-01 22:00:49,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:00:49,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,350 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 22:00:49,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-01 22:00:49,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:49,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,489 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-10-01 22:00:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,592 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-01 22:00:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:00:49,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-01 22:00:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,594 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:49,594 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:00:49,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:00:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:00:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-01 22:00:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:00:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-01 22:00:49,602 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 45 [2019-10-01 22:00:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,603 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-01 22:00:49,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-01 22:00:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:00:49,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,605 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-10-01 22:00:49,605 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash 986441794, now seen corresponding path program 2 times [2019-10-01 22:00:49,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,894 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-10-01 22:00:52,197 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-10-01 22:00:52,646 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-10-01 22:00:52,928 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-10-01 22:00:53,111 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-01 22:00:53,661 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-10-01 22:00:54,315 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 59 [2019-10-01 22:00:57,032 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2019-10-01 22:00:57,725 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2019-10-01 22:00:58,359 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2019-10-01 22:00:58,867 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-10-01 22:00:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:59,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,133 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:59,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:59,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:59,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:59,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-01 22:00:59,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:59,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 22:00:59,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:00:59,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:00:59,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:00:59,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-10-01 22:01:00,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:00,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 44 [2019-10-01 22:01:00,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:00,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 42 [2019-10-01 22:01:00,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:00,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:01:00,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:01:00,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:147, output treesize:95 [2019-10-01 22:01:00,662 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-10-01 22:01:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:00,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 53 [2019-10-01 22:01:00,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:00,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 63 [2019-10-01 22:01:00,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 57 [2019-10-01 22:01:00,890 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:00,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:00,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 63 [2019-10-01 22:01:00,908 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:01,043 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-10-01 22:01:01,044 INFO L567 ElimStorePlain]: treesize reduction 154, result has 45.6 percent of original size [2019-10-01 22:01:01,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:01:01,045 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:397, output treesize:129 [2019-10-01 22:01:01,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:01,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:01,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:01,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:01,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2019-10-01 22:01:01,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:01,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:01,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:01,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2019-10-01 22:01:01,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:01:01,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:01:01,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-01 22:01:01,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:151 [2019-10-01 22:01:02,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:02,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:02,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:02,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:01:02,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:02,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:02,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:02,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 39 [2019-10-01 22:01:02,065 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-01 22:01:02,073 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:02,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:01:02,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:01:02,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 52 [2019-10-01 22:01:02,079 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-01 22:01:02,176 INFO L567 ElimStorePlain]: treesize reduction 172, result has 42.1 percent of original size [2019-10-01 22:01:02,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:01:02,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:01:02,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 48 [2019-10-01 22:01:02,189 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-01 22:01:02,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:01:02,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-01 22:01:02,226 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:409, output treesize:73 [2019-10-01 22:01:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:01:02,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2019-10-01 22:01:02,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2086, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:02,592 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 48 states. [2019-10-01 22:01:04,079 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-01 22:01:05,231 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2019-10-01 22:01:07,980 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 61 [2019-10-01 22:01:08,688 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 66 [2019-10-01 22:01:09,194 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-10-01 22:01:14,817 WARN L191 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-10-01 22:01:16,486 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 121 DAG size of output: 107 [2019-10-01 22:01:20,776 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 121 DAG size of output: 107 [2019-10-01 22:01:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:21,036 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-10-01 22:01:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:01:21,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 51 [2019-10-01 22:01:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:21,042 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:01:21,042 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:01:21,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=350, Invalid=3940, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:01:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:01:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-10-01 22:01:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:01:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-10-01 22:01:21,063 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 51 [2019-10-01 22:01:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:21,064 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-10-01 22:01:21,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2019-10-01 22:01:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:01:21,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:21,066 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:21,066 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1056904772, now seen corresponding path program 3 times [2019-10-01 22:01:21,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:21,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:21,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 22:01:21,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:21,157 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:21,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:21,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:01:21,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:21,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:01:21,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-01 22:01:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-10-01 22:01:21,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:01:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:01:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:01:21,295 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 13 states. [2019-10-01 22:01:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:21,663 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2019-10-01 22:01:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:01:21,664 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-01 22:01:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:21,666 INFO L225 Difference]: With dead ends: 120 [2019-10-01 22:01:21,666 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:01:21,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:01:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:01:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-10-01 22:01:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 22:01:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-10-01 22:01:21,693 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 53 [2019-10-01 22:01:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:21,694 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-10-01 22:01:21,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:01:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-10-01 22:01:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:01:21,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:21,701 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 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] [2019-10-01 22:01:21,701 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash -213267264, now seen corresponding path program 4 times [2019-10-01 22:01:21,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 22:01:21,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:21,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:21,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:21,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:21,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:21,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:01:21,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 22:01:21,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:21,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-01 22:01:21,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:01:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:01:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:01:21,957 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 14 states. [2019-10-01 22:01:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:22,205 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-10-01 22:01:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:01:22,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-10-01 22:01:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:22,206 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:01:22,206 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 22:01:22,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:01:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 22:01:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2019-10-01 22:01:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 22:01:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-01 22:01:22,220 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 53 [2019-10-01 22:01:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:22,222 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-01 22:01:22,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:01:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-01 22:01:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 22:01:22,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:22,224 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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] [2019-10-01 22:01:22,224 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1973054432, now seen corresponding path program 5 times [2019-10-01 22:01:22,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:22,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,175 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2019-10-01 22:01:29,199 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 3 c_~N~0)) (.cse3 (= |c_main_~#x~0.offset| 0))) (and .cse0 (let ((.cse1 (< 3 c_~N~0))) (or .cse1 (let ((.cse4 (* 4 c_~N~0))) (let ((.cse2 (< 12 .cse4)) (.cse32 (<= 12 .cse4))) (and (or .cse2 .cse3) .cse0 (or .cse2 (and .cse0 (or .cse1 (and .cse0 (or .cse2 (and .cse0 (or (and .cse3 (or (not (= 12 .cse4)) (let ((.cse31 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse10 (select .cse31 (+ |c_main_~#x~0.offset| 4)))) (let ((.cse25 (* 3 c_~N~0)) (.cse9 (select .cse31 |c_main_~#x~0.offset|)) (.cse11 (select (store .cse31 |c_main_~#x~0.offset| .cse10) (+ .cse4 |c_main_~#x~0.offset| (- 4))))) (let ((.cse24 (* 4294967296 (div (+ .cse9 .cse10 .cse11 2147483651) 4294967296))) (.cse17 (+ .cse9 .cse25 .cse10 .cse11)) (.cse21 (* 4294967296 (div (+ .cse9 .cse10 .cse11 3) 4294967296))) (.cse30 (* 4294967296 (div (+ .cse9 .cse25 .cse10 .cse11 (- 6)) 4294967296)))) (let ((.cse14 (+ .cse25 (* 4294967296 (div (+ .cse30 .cse25 (- 9)) 4294967296)))) (.cse6 (<= (+ .cse9 .cse10 .cse11) (+ (* 4294967296 (div (+ .cse9 .cse25 .cse10 .cse11 (- 2147483654)) 4294967296)) 4294967292))) (.cse7 (+ .cse21 9)) (.cse19 (<= (+ .cse24 6) .cse17)) (.cse8 (+ .cse30 .cse25)) (.cse12 (+ .cse25 .cse9 .cse10 .cse11))) (let ((.cse5 (<= 9 .cse25)) (.cse13 (or .cse19 (let ((.cse29 (* 4294967296 (div (+ (* (- 3) c_~N~0) .cse21 4294967304) 4294967296)))) (let ((.cse26 (+ .cse29 9))) (and (<= .cse26 .cse8) (or (< .cse26 .cse8) (let ((.cse27 (+ (* 4294967296 (div (+ .cse25 .cse9 .cse10 .cse11 (- 2147483654)) 4294967296)) .cse25)) (.cse28 (+ .cse29 |c_main_#t~ret5| 4294967302))) (and (<= .cse26 .cse27) (or (= .cse12 .cse28) (< .cse26 .cse27)) (= .cse17 .cse28))))))))) (.cse15 (<= .cse7 (+ .cse25 (* 4294967296 (div (+ .cse25 (* 4294967296 (div (+ .cse25 .cse9 .cse10 .cse11 (- 6)) 4294967296)) (- 9)) 4294967296))))) (.cse18 (<= (+ .cse21 6) .cse17)) (.cse20 (or (let ((.cse23 (+ .cse24 9)) (.cse22 (+ .cse24 |c_main_#t~ret5| 6))) (and (or (= .cse22 .cse17) (< .cse23 .cse8)) (<= .cse23 .cse8) (<= .cse23 .cse14) (or (< .cse23 .cse14) (= .cse12 .cse22)))) .cse6))) (and .cse5 (or .cse6 (let ((.cse16 (+ |c_main_#t~ret5| .cse21 6))) (and (<= .cse7 .cse8) .cse5 (or (<= (+ (* 4294967296 (div (+ (* (- 1) |c_main_#t~ret5|) .cse9 .cse10 .cse11 4294967298) 4294967296)) 6) .cse12) .cse6) .cse13 (<= .cse7 .cse14) .cse15 (or (= .cse16 .cse17) (< .cse7 .cse8)) (or (< .cse7 .cse14) (= .cse12 .cse16)) .cse18 .cse19 .cse20))) .cse13 .cse15 .cse18 .cse20))))))))) (<= 1 |c_main_~#x~0.offset|) (<= (+ |c_main_~#x~0.offset| 1) 0)) .cse32 (not (= 8 .cse4)))) .cse32)))) .cse3 .cse32))))) .cse3)) is different from false [2019-10-01 22:01:42,195 WARN L191 SmtUtils]: Spent 10.50 s on a formula simplification. DAG size of input: 120 DAG size of output: 58 [2019-10-01 22:02:03,008 WARN L191 SmtUtils]: Spent 17.78 s on a formula simplification. DAG size of input: 140 DAG size of output: 92 [2019-10-01 22:02:05,151 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 3 c_~N~0)) (.cse1 (= |c_main_~#x~0.offset| 0))) (and .cse0 .cse1 (let ((.cse4 (< 3 c_~N~0))) (or (let ((.cse23 (* 4 c_~N~0))) (let ((.cse24 (<= 12 .cse23))) (and .cse0 (let ((.cse2 (not (= 12 .cse23))) (.cse3 (<= 1 |c_main_~#x~0.offset|)) (.cse10 (<= (+ |c_main_~#x~0.offset| 1) 0))) (or .cse2 .cse3 (and (or .cse4 (and (or (and .cse0 (let ((.cse22 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse13 (select .cse22 |c_main_~#x~0.offset|)) (.cse14 (select .cse22 (+ .cse23 |c_main_~#x~0.offset| (- 4)))) (.cse15 (select .cse22 (+ |c_main_~#x~0.offset| 4)))) (let ((.cse12 (* 3 c_~N~0)) (.cse16 (* 4294967296 (div (+ .cse13 .cse14 .cse15 3) 4294967296)))) (let ((.cse18 (+ .cse16 9)) (.cse21 (+ (* 4294967296 (div (+ .cse12 .cse13 .cse14 .cse15 (- 6)) 4294967296)) .cse12)) (.cse17 (+ .cse12 .cse13 .cse14 .cse15))) (let ((.cse6 (<= (+ (* 4294967296 (div (+ .cse13 .cse14 .cse15 2147483651) 4294967296)) 6) .cse17)) (.cse5 (= c_main_~ret~1 |c_main_#t~ret8|)) (.cse8 (<= .cse18 .cse21)) (.cse9 (or (= (+ c_main_~ret~1 .cse16 6) .cse17) (< .cse18 .cse21)))) (let ((.cse7 (let ((.cse20 (* 4294967296 (div (+ .cse12 .cse13 .cse14 .cse15 (- 2147483654)) 4294967296))) (.cse11 (+ .cse13 .cse14 .cse15))) (and (or (<= .cse11 (+ (* 4294967296 (div (+ .cse12 .cse13 .cse14 .cse15 (- 6442450950)) 4294967296)) 4294967292)) .cse6 (let ((.cse19 (+ .cse20 .cse12))) (and .cse5 (or (= (+ c_main_~ret~1 .cse16 4294967302) .cse17) (< .cse18 .cse19)) (<= .cse18 .cse19))) (<= .cse11 (+ (* 4294967296 (div (+ .cse12 .cse13 .cse14 .cse15 (- 4294967302)) 4294967296)) 4294967292))) (or (<= (+ .cse16 2147483654) .cse17) (and .cse5 .cse8 .cse9)) (or (<= .cse11 (+ .cse20 4294967292)) (<= .cse11 (+ (* 4294967296 (div (+ .cse12 .cse13 .cse14 .cse15 (- 7)) 4294967296)) 4294967292))))))) (or .cse2 .cse3 (and .cse5 (or .cse6 .cse7) .cse8 .cse9) .cse4 .cse10 .cse7))))))) .cse24) .cse3 .cse10) .cse0)) .cse0) .cse10 (< 12 .cse23))) .cse1 .cse24))) .cse4)))) is different from false [2019-10-01 22:02:26,371 WARN L191 SmtUtils]: Spent 18.96 s on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-10-01 22:02:28,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 3 c_~N~0)) (.cse29 (= |c_main_~#x~0.offset| 0))) (and .cse0 (let ((.cse9 (< 3 c_~N~0))) (or (let ((.cse26 (* 4 c_~N~0))) (let ((.cse7 (<= 12 .cse26))) (and .cse0 (let ((.cse1 (not (= 12 .cse26))) (.cse6 (<= 1 |c_main_~#x~0.offset|)) (.cse10 (<= (+ |c_main_~#x~0.offset| 1) 0))) (or .cse1 (let ((.cse4 (* 4 c_main_~i~2))) (let ((.cse28 (= .cse26 (+ .cse4 4)))) (and (or (<= (+ c_main_~i~2 4) c_~N~0) (let ((.cse3 (+ .cse4 |c_main_~#x~0.offset|))) (let ((.cse2 (= 0 .cse3))) (let ((.cse5 (not .cse2))) (and .cse0 (or .cse2 (and (or (< 0 .cse3) .cse0 (< 0 (+ .cse4 |c_main_~#x~0.offset| 1))) .cse5)) (or (let ((.cse27 (= 0 .cse4))) (and (or .cse6 (and .cse0 .cse7 (let ((.cse25 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse16 (select .cse25 .cse3)) (.cse18 (select .cse25 (+ .cse26 |c_main_~#x~0.offset| (- 4))))) (let ((.cse20 (* 4294967296 (div (+ .cse16 c_main_~temp~0 .cse18 3) 4294967296))) (.cse17 (* 3 c_~N~0))) (let ((.cse21 (+ .cse16 .cse17 c_main_~temp~0 .cse18)) (.cse22 (+ .cse20 9)) (.cse24 (+ .cse17 (* 4294967296 (div (+ .cse16 .cse17 c_main_~temp~0 .cse18 (- 6)) 4294967296))))) (let ((.cse12 (or (= (+ .cse20 c_main_~ret~1 6) .cse21) (< .cse22 .cse24))) (.cse13 (<= .cse22 .cse24)) (.cse11 (= c_main_~ret~1 c_main_~ret2~0)) (.cse14 (<= (+ (* 4294967296 (div (+ .cse16 c_main_~temp~0 .cse18 2147483651) 4294967296)) 6) .cse21))) (let ((.cse8 (let ((.cse19 (* 4294967296 (div (+ .cse16 .cse17 c_main_~temp~0 .cse18 (- 2147483654)) 4294967296))) (.cse15 (+ .cse16 c_main_~temp~0 .cse18))) (and (or (<= .cse15 (+ (* 4294967296 (div (+ .cse16 .cse17 c_main_~temp~0 .cse18 (- 7)) 4294967296)) 4294967292)) (<= .cse15 (+ .cse19 4294967292))) (or (<= (+ .cse20 2147483654) .cse21) (and .cse11 .cse12 .cse13)) (or (let ((.cse23 (+ .cse19 .cse17))) (and .cse11 (<= .cse22 .cse23) (or (< .cse22 .cse23) (= .cse21 (+ .cse20 c_main_~ret~1 4294967302))))) .cse14 (<= .cse15 (+ (* 4294967296 (div (+ .cse16 .cse17 c_main_~temp~0 .cse18 (- 6442450950)) 4294967296)) 4294967292)) (<= .cse15 (+ (* 4294967296 (div (+ .cse16 .cse17 c_main_~temp~0 .cse18 (- 4294967302)) 4294967296)) 4294967292))))))) (or .cse1 .cse6 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 (or .cse14 .cse8)))))))))) .cse10 (not .cse27)) (or (= (+ .cse4 12) .cse26) .cse27))) .cse5))))) (<= 1 c_main_~i~2) .cse28) (or (and (<= (+ c_main_~i~2 2) c_~N~0) (= c_~N~0 (+ c_main_~i~2 1))) (not .cse28))))) .cse6 .cse10 (< 12 .cse26))) .cse29 .cse7))) .cse9)) .cse29 (= c_main_~i~2 0))) is different from false [2019-10-01 22:03:15,334 WARN L191 SmtUtils]: Spent 45.87 s on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2019-10-01 22:03:37,545 WARN L191 SmtUtils]: Spent 21.33 s on a formula simplification. DAG size of input: 140 DAG size of output: 55 [2019-10-01 22:03:39,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse9 (<= (+ c_main_~i~2 2) c_~N~0))) (or (let ((.cse21 (* 4 c_~N~0))) (let ((.cse22 (<= 12 .cse21))) (and .cse0 (let ((.cse1 (<= 1 |c_main_~#x~0.offset|)) (.cse7 (<= (+ |c_main_~#x~0.offset| 1) 0)) (.cse8 (< 12 .cse21))) (or .cse1 (and (<= 3 c_~N~0) (or .cse1 (and (let ((.cse20 (store (select |c_#memory_int| |c_main_~#x~0.base|) (+ .cse21 |c_main_~#x~0.offset| (- 4)) c_main_~temp~0))) (let ((.cse11 (select .cse20 (+ .cse21 |c_main_~#x~0.offset| (- 8)))) (.cse13 (select .cse20 0))) (let ((.cse12 (* 3 c_~N~0)) (.cse18 (* 4294967296 (div (+ .cse11 c_main_~temp~0 .cse13 3) 4294967296)))) (let ((.cse15 (+ .cse18 9)) (.cse19 (+ (* 4294967296 (div (+ .cse11 .cse12 c_main_~temp~0 .cse13 (- 6)) 4294967296)) .cse12)) (.cse17 (+ .cse11 .cse12 c_main_~temp~0 .cse13))) (let ((.cse6 (<= (+ (* 4294967296 (div (+ .cse11 c_main_~temp~0 .cse13 2147483651) 4294967296)) 6) .cse17)) (.cse3 (<= .cse15 .cse19)) (.cse4 (= c_main_~ret~1 c_main_~ret2~0)) (.cse5 (or (= (+ .cse18 c_main_~ret~1 6) .cse17) (< .cse15 .cse19)))) (let ((.cse2 (let ((.cse14 (* 4294967296 (div (+ .cse11 .cse12 c_main_~temp~0 .cse13 (- 2147483654)) 4294967296))) (.cse10 (+ .cse11 c_main_~temp~0 .cse13))) (and (or (<= .cse10 (+ (* 4294967296 (div (+ .cse11 .cse12 c_main_~temp~0 .cse13 (- 7)) 4294967296)) 4294967292)) (<= .cse10 (+ .cse14 4294967292))) (or (<= .cse10 (+ (* 4294967296 (div (+ .cse11 .cse12 c_main_~temp~0 .cse13 (- 6442450950)) 4294967296)) 4294967292)) .cse6 (let ((.cse16 (+ .cse12 .cse14))) (and .cse4 (or (< .cse15 .cse16) (= .cse17 (+ .cse18 c_main_~ret~1 4294967302))) (<= .cse15 .cse16))) (<= .cse10 (+ (* 4294967296 (div (+ .cse11 .cse12 c_main_~temp~0 .cse13 (- 4294967302)) 4294967296)) 4294967292))) (or (<= (+ .cse18 2147483654) .cse17) (and .cse3 .cse4 .cse5)))))) (or .cse2 .cse1 (and .cse3 .cse4 .cse5 (or .cse2 .cse6)) .cse7 .cse8 .cse9))))))) .cse22) (<= (+ (* 4 c_main_~i~2) |c_main_~#x~0.offset| 5) .cse21) .cse7)) .cse7 .cse8 .cse9)) .cse22))) .cse9)) .cse0)) is different from false [2019-10-01 22:04:05,192 WARN L191 SmtUtils]: Spent 18.45 s on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2019-10-01 22:04:32,110 WARN L191 SmtUtils]: Spent 17.38 s on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-10-01 22:05:08,969 WARN L191 SmtUtils]: Spent 31.03 s on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-10-01 22:05:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 38 proven. 69 refuted. 0 times theorem prover too weak. 17 trivial. 3 not checked. [2019-10-01 22:05:11,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:05:11,124 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:05:11,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:05:11,365 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 22:05:11,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:11,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 111 conjunts are in the unsatisfiable core [2019-10-01 22:05:11,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:11,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-01 22:05:11,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:11,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:11,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:05:11,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-10-01 22:05:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:16,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 58 [2019-10-01 22:05:16,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:16,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:16,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 56 [2019-10-01 22:05:16,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:16,480 INFO L567 ElimStorePlain]: treesize reduction 6, result has 95.3 percent of original size [2019-10-01 22:05:16,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:05:16,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:181, output treesize:123 [2019-10-01 22:05:19,540 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-01 22:05:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:20,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:20,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 75 [2019-10-01 22:05:20,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:20,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 79 [2019-10-01 22:05:20,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:20,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 86 [2019-10-01 22:05:20,369 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:20,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:20,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:20,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 86 [2019-10-01 22:05:20,391 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:20,532 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-01 22:05:20,532 INFO L567 ElimStorePlain]: treesize reduction 262, result has 44.4 percent of original size [2019-10-01 22:05:20,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:05:20,533 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:535, output treesize:209 [2019-10-01 22:05:22,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:22,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 65 [2019-10-01 22:05:22,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:22,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:22,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:22,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2019-10-01 22:05:22,960 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:23,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:23,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:05:23,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:203, output treesize:169 [2019-10-01 22:05:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:23,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,177 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:23,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 72 [2019-10-01 22:05:23,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:23,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:23,212 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:23,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 68 [2019-10-01 22:05:23,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:05:23,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:23,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:05:23,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:201, output treesize:193 [2019-10-01 22:05:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:26,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:26,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:26,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:05:26,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:26,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:26,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 56 [2019-10-01 22:05:26,532 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-01 22:05:26,537 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:26,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:26,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 61 [2019-10-01 22:05:26,545 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-01 22:05:26,645 INFO L567 ElimStorePlain]: treesize reduction 203, result has 43.0 percent of original size [2019-10-01 22:05:26,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:05:26,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:05:26,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:26,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 46 [2019-10-01 22:05:26,660 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-01 22:05:26,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:05:26,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-10-01 22:05:26,695 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:509, output treesize:81 [2019-10-01 22:05:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 108 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:05:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 68 [2019-10-01 22:05:29,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:05:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:05:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=3660, Unknown=20, NotChecked=508, Total=4556 [2019-10-01 22:05:29,136 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 68 states. [2019-10-01 22:05:43,236 WARN L191 SmtUtils]: Spent 14.04 s on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-10-01 22:05:55,624 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 34 [2019-10-01 22:06:05,091 WARN L191 SmtUtils]: Spent 5.83 s on a formula simplification. DAG size of input: 164 DAG size of output: 36 [2019-10-01 22:06:46,344 WARN L191 SmtUtils]: Spent 30.53 s on a formula simplification. DAG size of input: 133 DAG size of output: 69 [2019-10-01 22:06:46,602 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-10-01 22:06:52,289 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 163 DAG size of output: 44 [2019-10-01 22:07:10,264 WARN L191 SmtUtils]: Spent 17.70 s on a formula simplification. DAG size of input: 140 DAG size of output: 47 [2019-10-01 22:07:10,842 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2019-10-01 22:07:19,391 WARN L191 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 138 DAG size of output: 40 [2019-10-01 22:07:22,087 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-01 22:07:42,573 WARN L191 SmtUtils]: Spent 14.22 s on a formula simplification. DAG size of input: 117 DAG size of output: 56 [2019-10-01 22:07:44,939 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-10-01 22:07:45,789 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-01 22:08:05,630 WARN L191 SmtUtils]: Spent 7.73 s on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2019-10-01 22:08:06,051 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-10-01 22:08:06,535 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-10-01 22:08:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:06,626 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-10-01 22:08:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:08:06,627 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 61 [2019-10-01 22:08:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:06,628 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:08:06,628 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 22:08:06,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 27 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2843 ImplicationChecksByTransitivity, 379.3s TimeCoverageRelationStatistics Valid=669, Invalid=6977, Unknown=26, NotChecked=700, Total=8372 [2019-10-01 22:08:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 22:08:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-10-01 22:08:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:08:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-10-01 22:08:06,641 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 61 [2019-10-01 22:08:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:06,641 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-10-01 22:08:06,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:08:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-10-01 22:08:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:08:06,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:06,643 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 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] [2019-10-01 22:08:06,643 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 70872670, now seen corresponding path program 6 times [2019-10-01 22:08:06,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:06,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:06,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-01 22:08:06,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:06,746 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:08:06,784 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:08:06,858 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-01 22:08:06,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:06,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:08:06,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 49 proven. 66 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-01 22:08:06,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:06,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-10-01 22:08:06,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:08:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:08:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:08:06,943 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 17 states. [2019-10-01 22:08:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:07,299 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2019-10-01 22:08:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:08:07,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-10-01 22:08:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:07,301 INFO L225 Difference]: With dead ends: 167 [2019-10-01 22:08:07,302 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 22:08:07,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:08:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 22:08:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2019-10-01 22:08:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:08:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-01 22:08:07,341 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 63 [2019-10-01 22:08:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:07,341 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-01 22:08:07,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:08:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-01 22:08:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:08:07,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:07,343 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:08:07,343 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1690278300, now seen corresponding path program 7 times [2019-10-01 22:08:07,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:07,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:07,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:07,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:07,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-01 22:08:07,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:07,439 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:08:07,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:08:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:07,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:08:07,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-01 22:08:07,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:07,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-10-01 22:08:07,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:08:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:08:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:08:07,577 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2019-10-01 22:08:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:07,747 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2019-10-01 22:08:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:08:07,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-10-01 22:08:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:07,749 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:08:07,749 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:08:07,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:08:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:08:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:08:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:08:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2019-10-01 22:08:07,758 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 65 [2019-10-01 22:08:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:07,759 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2019-10-01 22:08:07,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:08:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2019-10-01 22:08:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:08:07,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:07,761 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:08:07,761 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1266607074, now seen corresponding path program 8 times [2019-10-01 22:08:07,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:08:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-01 22:08:07,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:07,863 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:08:07,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:08:07,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:08:07,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:07,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:08:07,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-01 22:08:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:08,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-10-01 22:08:08,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:08:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:08:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:08:08,033 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 17 states. [2019-10-01 22:08:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:08,232 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-10-01 22:08:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:08:08,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-10-01 22:08:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:08,234 INFO L225 Difference]: With dead ends: 82 [2019-10-01 22:08:08,234 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 22:08:08,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:08:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 22:08:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-01 22:08:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:08:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-01 22:08:08,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 67 [2019-10-01 22:08:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:08,242 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-01 22:08:08,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:08:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-01 22:08:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:08:08,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:08,244 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 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] [2019-10-01 22:08:08,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1044420768, now seen corresponding path program 9 times [2019-10-01 22:08:08,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:08,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:08,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:08,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:08,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-01 22:08:08,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:08,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:08:08,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:08:08,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-01 22:08:08,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:08,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:08:08,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:08:08,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-01 22:08:08,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:08:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:08:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:08:08,614 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 18 states. [2019-10-01 22:08:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:08,866 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-10-01 22:08:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:08:08,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-10-01 22:08:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:08,867 INFO L225 Difference]: With dead ends: 66 [2019-10-01 22:08:08,868 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 22:08:08,868 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:08:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 22:08:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-01 22:08:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:08:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-01 22:08:08,873 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 69 [2019-10-01 22:08:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:08,873 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-01 22:08:08,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:08:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-01 22:08:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 22:08:08,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:08,875 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:08:08,875 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1946275326, now seen corresponding path program 10 times [2019-10-01 22:08:08,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:08,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:08,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:09,950 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 15 [2019-10-01 22:08:10,178 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 9 [2019-10-01 22:08:11,514 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-10-01 22:08:14,814 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 135 DAG size of output: 34 [2019-10-01 22:08:29,243 WARN L191 SmtUtils]: Spent 13.45 s on a formula simplification. DAG size of input: 121 DAG size of output: 33 [2019-10-01 22:08:37,922 WARN L191 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2019-10-01 22:08:44,354 WARN L191 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 138 DAG size of output: 43 [2019-10-01 22:08:52,367 WARN L191 SmtUtils]: Spent 7.82 s on a formula simplification. DAG size of input: 140 DAG size of output: 39 [2019-10-01 22:09:01,521 WARN L191 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 149 DAG size of output: 64 [2019-10-01 22:09:06,135 WARN L191 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 151 DAG size of output: 41 [2019-10-01 22:09:10,751 WARN L191 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 122 DAG size of output: 51 [2019-10-01 22:09:12,095 WARN L191 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 48 [2019-10-01 22:09:22,434 WARN L191 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 109 DAG size of output: 44 [2019-10-01 22:09:37,704 WARN L191 SmtUtils]: Spent 14.25 s on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-10-01 22:09:41,457 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 98 DAG size of output: 38 [2019-10-01 22:09:42,261 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-01 22:09:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 55 proven. 134 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-01 22:09:42,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:42,415 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:42,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:09:42,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:09:42,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:42,680 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 134 conjunts are in the unsatisfiable core [2019-10-01 22:09:42,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:42,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 22:09:42,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:42,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:09:42,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:09:42,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-10-01 22:09:49,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:49,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 72 [2019-10-01 22:09:49,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:49,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:49,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 74 [2019-10-01 22:09:49,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:50,085 INFO L567 ElimStorePlain]: treesize reduction 43, result has 74.3 percent of original size [2019-10-01 22:09:50,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:09:50,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:124 [2019-10-01 22:09:51,259 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-10-01 22:09:51,544 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-01 22:09:51,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:51,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:51,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:51,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 87 [2019-10-01 22:09:51,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:51,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 102 [2019-10-01 22:09:51,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:51,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 90 [2019-10-01 22:09:51,686 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:51,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,703 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:51,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:51,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 99 [2019-10-01 22:09:51,718 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:51,854 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-01 22:09:51,855 INFO L567 ElimStorePlain]: treesize reduction 331, result has 37.8 percent of original size [2019-10-01 22:09:51,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:09:51,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:591, output treesize:201 [2019-10-01 22:09:52,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:52,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 89 [2019-10-01 22:09:52,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:52,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 83 [2019-10-01 22:09:52,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:52,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:09:52,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:09:52,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:249, output treesize:211 [2019-10-01 22:09:52,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:52,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 91 [2019-10-01 22:09:52,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:52,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:52,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:52,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 97 [2019-10-01 22:09:52,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:53,020 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-01 22:09:53,021 INFO L567 ElimStorePlain]: treesize reduction 6, result has 97.4 percent of original size [2019-10-01 22:09:53,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:09:53,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:273, output treesize:229 [2019-10-01 22:09:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:53,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:53,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:09:53,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,770 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:53,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2019-10-01 22:09:53,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:53,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:09:53,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:09:53,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2019-10-01 22:09:53,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:09:53,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:09:53,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-01 22:09:53,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:199, output treesize:173 [2019-10-01 22:10:01,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:10:01,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:10:01,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:10:01,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:10:01,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:10:01,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 55 [2019-10-01 22:10:01,046 INFO L496 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-01 22:10:01,176 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-10-01 22:10:01,177 INFO L567 ElimStorePlain]: treesize reduction 232, result has 46.4 percent of original size [2019-10-01 22:10:01,177 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-10-01 22:10:01,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:10:01,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:10:01,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 43 [2019-10-01 22:10:01,197 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-01 22:10:01,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:10:01,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:10:01,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:10:01,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:10:01,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 51 [2019-10-01 22:10:01,255 INFO L496 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-01 22:10:01,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:10:01,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-10-01 22:10:01,292 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:505, output treesize:77 [2019-10-01 22:10:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 8 proven. 195 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:10:01,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:01,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 49] total 90 [2019-10-01 22:10:01,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 22:10:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 22:10:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=7325, Unknown=2, NotChecked=0, Total=8010 [2019-10-01 22:10:01,689 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 90 states. [2019-10-01 22:10:05,568 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-10-01 22:10:06,146 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-10-01 22:10:06,725 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-10-01 22:10:07,459 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-01 22:10:08,082 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-01 22:10:08,421 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-01 22:10:11,002 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-01 22:10:12,911 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-10-01 22:10:13,535 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-01 22:10:14,334 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-01 22:10:14,679 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-01 22:10:15,326 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-01 22:10:15,715 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-01 22:10:17,768 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 72 [2019-10-01 22:10:19,067 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-10-01 22:10:21,246 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-10-01 22:10:24,773 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-10-01 22:10:25,090 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-01 22:10:29,338 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-10-01 22:10:36,899 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2019-10-01 22:10:38,472 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2019-10-01 22:10:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:40,910 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-10-01 22:10:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:10:40,911 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 71 [2019-10-01 22:10:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:40,912 INFO L225 Difference]: With dead ends: 116 [2019-10-01 22:10:40,912 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 22:10:40,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 28 SyntacticMatches, 12 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6363 ImplicationChecksByTransitivity, 139.0s TimeCoverageRelationStatistics Valid=1389, Invalid=15898, Unknown=5, NotChecked=0, Total=17292 [2019-10-01 22:10:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 22:10:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2019-10-01 22:10:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 22:10:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2019-10-01 22:10:40,930 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 71 [2019-10-01 22:10:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:40,931 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2019-10-01 22:10:40,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 22:10:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2019-10-01 22:10:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 22:10:40,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:40,933 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:40,933 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1231211652, now seen corresponding path program 11 times [2019-10-01 22:10:40,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:40,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:40,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 115 proven. 32 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-01 22:10:41,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:41,066 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:41,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:10:41,197 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:10:41,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:41,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:10:41,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 92 proven. 98 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-01 22:10:41,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:41,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-10-01 22:10:41,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:10:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:10:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:10:41,362 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 24 states. [2019-10-01 22:10:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:41,919 INFO L93 Difference]: Finished difference Result 160 states and 188 transitions. [2019-10-01 22:10:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:10:41,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-10-01 22:10:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:41,921 INFO L225 Difference]: With dead ends: 160 [2019-10-01 22:10:41,922 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 22:10:41,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:10:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 22:10:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2019-10-01 22:10:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:10:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-10-01 22:10:41,933 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 73 [2019-10-01 22:10:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:41,934 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-10-01 22:10:41,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:10:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-10-01 22:10:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 22:10:41,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:41,935 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:41,935 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 110554298, now seen corresponding path program 12 times [2019-10-01 22:10:41,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:41,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-01 22:10:42,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:42,062 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:42,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:10:42,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:10:42,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:42,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:10:42,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 106 proven. 25 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 22:10:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-10-01 22:10:42,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:10:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:10:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:10:42,442 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 24 states. [2019-10-01 22:10:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:42,912 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2019-10-01 22:10:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:10:42,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-10-01 22:10:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:42,919 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:10:42,920 INFO L226 Difference]: Without dead ends: 93 [2019-10-01 22:10:42,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:10:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-01 22:10:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2019-10-01 22:10:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:10:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-10-01 22:10:42,929 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 75 [2019-10-01 22:10:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:42,930 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-10-01 22:10:42,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:10:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-10-01 22:10:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 22:10:42,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:42,931 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:42,931 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2032238462, now seen corresponding path program 13 times [2019-10-01 22:10:42,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:42,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:42,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-10-01 22:10:43,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:43,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:10:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:43,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:10:43,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 146 proven. 18 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 22:10:43,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:43,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-10-01 22:10:43,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:10:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:10:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:10:43,213 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 17 states. [2019-10-01 22:10:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:43,418 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-10-01 22:10:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:10:43,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-10-01 22:10:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:43,420 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:10:43,420 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 22:10:43,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:10:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 22:10:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-01 22:10:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:10:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-10-01 22:10:43,428 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 79 [2019-10-01 22:10:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:43,428 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-10-01 22:10:43,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:10:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-10-01 22:10:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 22:10:43,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:43,429 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:43,429 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1351642780, now seen corresponding path program 14 times [2019-10-01 22:10:43,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:43,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:43,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:43,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:10:43,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:49,488 WARN L191 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-10-01 22:10:51,636 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 5 c_~N~0))) (and .cse0 (let ((.cse2 (< 5 c_~N~0))) (or (let ((.cse7 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse1 (<= 1 |c_main_~#x~0.offset|)) (.cse10 (<= (+ |c_main_~#x~0.offset| 1) 0))) (or .cse1 (and .cse0 (or (<= 4 |c_main_~#x~0.offset|) .cse2 (<= 8 |c_main_~#x~0.offset|) (let ((.cse4 (* 4 c_~N~0))) (let ((.cse3 (not (= 12 .cse4))) (.cse5 (<= 20 .cse4)) (.cse6 (= 4 .cse4))) (and .cse3 (not (= .cse4 16)) .cse5 (or (and (<= 2 c_~N~0) (= c_~N~0 1)) (not .cse6)) (or (and (or .cse2 (and (or .cse2 (and (or .cse2 (let ((.cse9 (not (= 8 .cse4)))) (and .cse5 .cse7 (let ((.cse8 (< 20 .cse4))) (or .cse8 (and .cse0 (or .cse1 (and (= 20 .cse4) (or .cse1 (and (or .cse2 (and .cse3 .cse5 .cse9 (or .cse1 .cse8 .cse10 (and .cse5 (or (and (or (and .cse3 .cse5 (let ((.cse33 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse25 (select .cse33 (+ |c_main_~#x~0.offset| 4)))) (let ((.cse34 (store .cse33 |c_main_~#x~0.offset| .cse25))) (let ((.cse28 (select .cse34 (+ .cse4 |c_main_~#x~0.offset| (- 8)))) (.cse27 (select .cse34 (+ .cse4 |c_main_~#x~0.offset| (- 12)))) (.cse26 (select .cse34 (+ .cse4 |c_main_~#x~0.offset| (- 4)))) (.cse24 (select .cse33 |c_main_~#x~0.offset|))) (let ((.cse15 (* 2 .cse24)) (.cse17 (* 2 .cse25)) (.cse18 (* 2 .cse26)) (.cse19 (* 2 .cse27)) (.cse20 (* 2 .cse28)) (.cse16 (* 5 c_~N~0))) (let ((.cse11 (+ .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse14 (+ .cse24 .cse16 .cse25 .cse26 .cse27 .cse28)) (.cse22 (* 4294967296 (div (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (- 4)) 8589934592))) (.cse23 (* 4294967296 (div (+ .cse24 .cse25 .cse26 .cse27 .cse28 10) 4294967296)))) (or (let ((.cse12 (div (+ .cse24 .cse16 .cse25 .cse26 .cse27 .cse28 (- 2147483663)) 4294967296))) (let ((.cse13 (+ .cse23 (div (+ .cse15 .cse16 (* (- 8589934592) .cse12) .cse17 .cse18 .cse19 .cse20 (- 8589934596)) 2) 4294967311))) (and (<= .cse11 (+ (* 4294967296 .cse12) 4294967285)) (or (< .cse13 .cse14) (let ((.cse21 (+ .cse22 (div (+ .cse15 (* (- 8589934592) (div (+ .cse24 (* (- 1) |c_main_#t~ret5|) .cse16 .cse25 .cse26 .cse27 .cse28 (- 4294967311)) 4294967296)) .cse16 .cse17 .cse18 .cse19 .cse20 (- 8589934596)) 2) 4294967311))) (and (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (+ (* 8589934592 .cse12) 8589934595)) (or (< .cse21 .cse14) (= (+ .cse22 |c_main_#t~ret5| 4294967311) .cse14)) (<= .cse21 .cse14) (= (+ .cse23 |c_main_#t~ret5| 4294967311) .cse14)))) (<= .cse13 .cse14)))) .cse8 (let ((.cse29 (* 4294967296 (div (+ .cse24 .cse16 .cse25 .cse26 .cse27 .cse28 (- 15)) 4294967296)))) (let ((.cse30 (+ .cse23 25)) (.cse31 (+ .cse16 .cse29))) (and (<= .cse11 (+ .cse29 2147483637)) (or (< .cse30 .cse31) (let ((.cse32 (+ .cse22 25))) (and (<= (+ (* 4294967296 (div (+ .cse24 .cse25 .cse26 .cse27 .cse28 2147483658) 4294967296)) 15) .cse14) (= (+ .cse23 |c_main_#t~ret5| 15) .cse14) (<= .cse32 .cse31) (or (= .cse14 (+ .cse22 |c_main_#t~ret5| 15)) (< .cse32 .cse31))))) (<= .cse30 .cse31)))))))))))) .cse8) .cse5 .cse0 .cse7 .cse9) .cse8))))) .cse0) .cse10)) .cse10) .cse7))) .cse9))) .cse0)) .cse0)) .cse0) .cse6)))))) .cse10)) .cse7)) .cse2)))) is different from false [2019-10-01 22:11:24,467 WARN L191 SmtUtils]: Spent 23.88 s on a formula simplification. DAG size of input: 167 DAG size of output: 70 [2019-10-01 22:11:45,280 WARN L191 SmtUtils]: Spent 15.48 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2019-10-01 22:11:46,520 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 139 DAG size of output: 68 [2019-10-01 22:11:50,238 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 140 DAG size of output: 66 [2019-10-01 22:11:55,377 WARN L191 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 145 DAG size of output: 71 [2019-10-01 22:12:05,006 WARN L191 SmtUtils]: Spent 9.45 s on a formula simplification. DAG size of input: 147 DAG size of output: 75 [2019-10-01 22:12:27,889 WARN L191 SmtUtils]: Spent 22.71 s on a formula simplification. DAG size of input: 149 DAG size of output: 84 [2019-10-01 22:12:38,033 WARN L191 SmtUtils]: Spent 9.91 s on a formula simplification. DAG size of input: 151 DAG size of output: 80 [2019-10-01 22:12:47,127 WARN L191 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2019-10-01 22:12:57,955 WARN L191 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2019-10-01 22:13:08,686 WARN L191 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2019-10-01 22:13:42,705 WARN L191 SmtUtils]: Spent 25.68 s on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-10-01 22:14:00,343 WARN L191 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 110 DAG size of output: 65 [2019-10-01 22:14:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 87 proven. 191 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-01 22:14:02,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:02,002 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:14:02,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:14:02,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:02,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 147 conjunts are in the unsatisfiable core [2019-10-01 22:14:02,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:05,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 22:14:05,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:05,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-10-01 22:14:05,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 22:14:05,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:05,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-10-01 22:14:05,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 22:14:05,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:05,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:14:05,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-10-01 22:14:09,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:09,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 80 [2019-10-01 22:14:09,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:09,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:09,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 78 [2019-10-01 22:14:09,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:09,703 INFO L567 ElimStorePlain]: treesize reduction 42, result has 77.3 percent of original size [2019-10-01 22:14:09,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:14:09,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:237, output treesize:143 [2019-10-01 22:14:12,766 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-01 22:14:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:13,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 112 [2019-10-01 22:14:13,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:13,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 104 [2019-10-01 22:14:13,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:13,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,201 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 102 [2019-10-01 22:14:13,243 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:13,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:13,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:13,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 103 [2019-10-01 22:14:13,293 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:13,543 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-01 22:14:13,544 INFO L567 ElimStorePlain]: treesize reduction 338, result has 46.4 percent of original size [2019-10-01 22:14:13,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:14:13,545 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:698, output treesize:293 [2019-10-01 22:14:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:15,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:15,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:15,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 102 [2019-10-01 22:14:15,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:15,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:15,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:15,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 106 [2019-10-01 22:14:15,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:15,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:15,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:14:15,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:347, output treesize:311 [2019-10-01 22:14:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:16,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:16,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:16,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 109 [2019-10-01 22:14:16,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:16,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:16,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:16,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 105 [2019-10-01 22:14:16,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:16,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:16,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:14:16,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:365, output treesize:335 [2019-10-01 22:14:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:20,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 89 [2019-10-01 22:14:20,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:20,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:20,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:20,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 93 [2019-10-01 22:14:20,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:20,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:20,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:14:20,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:291, output treesize:253 [2019-10-01 22:14:21,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:21,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:21,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 96 [2019-10-01 22:14:21,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:21,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:21,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:21,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 92 [2019-10-01 22:14:21,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:14:21,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:21,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-01 22:14:21,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:285, output treesize:277 [2019-10-01 22:14:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:14:27,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:27,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:27,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 57 [2019-10-01 22:14:27,315 INFO L496 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-01 22:14:27,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:27,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:27,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 69 [2019-10-01 22:14:27,332 INFO L496 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-01 22:14:27,437 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-10-01 22:14:27,438 INFO L567 ElimStorePlain]: treesize reduction 277, result has 41.6 percent of original size [2019-10-01 22:14:27,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 22:14:27,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:14:27,449 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:27,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 139 treesize of output 54 [2019-10-01 22:14:27,450 INFO L496 ElimStorePlain]: Start of recursive call 4: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-01 22:14:27,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:14:27,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-10-01 22:14:27,489 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:709, output treesize:97 [2019-10-01 22:14:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:14:29,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:29,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 47] total 89 [2019-10-01 22:14:29,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 22:14:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 22:14:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=7001, Unknown=17, NotChecked=172, Total=7832 [2019-10-01 22:14:29,990 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 89 states. [2019-10-01 22:14:34,333 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-01 22:14:47,804 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 79