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/loops/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:06,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:06,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:06,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:06,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:06,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:06,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:06,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:06,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:06,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:06,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:06,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:06,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:06,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:06,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:06,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:06,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:06,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:06,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:06,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:06,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:06,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:06,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:06,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:06,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:06,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:06,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:06,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:06,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:06,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:06,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:06,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:06,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:06,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:06,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:06,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:06,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:06,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:06,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:06,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:06,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:06,977 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-09-05 11:29:06,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:06,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:06,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:06,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:06,993 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:06,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:06,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:06,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:06,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:06,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:06,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:06,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:06,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:06,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:06,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:06,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:06,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:06,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:06,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:06,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:06,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:06,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:06,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:06,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:06,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:07,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:07,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:07,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:07,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:07,050 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:07,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-1.c [2019-09-05 11:29:07,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f666d4ca3/87d313caf155419c85d6a0c441fbd125/FLAG7395d33cf [2019-09-05 11:29:07,582 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:07,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2019-09-05 11:29:07,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f666d4ca3/87d313caf155419c85d6a0c441fbd125/FLAG7395d33cf [2019-09-05 11:29:07,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f666d4ca3/87d313caf155419c85d6a0c441fbd125 [2019-09-05 11:29:07,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:07,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:07,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:07,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:07,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:07,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:07,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5061f25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:07, skipping insertion in model container [2019-09-05 11:29:07,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:07,992 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:08,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:08,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,237 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:08,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,386 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:08,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08 WrapperNode [2019-09-05 11:29:08,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:08,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:08,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:08,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:08,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:08,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (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-09-05 11:29:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:29:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:29:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:08,929 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:08,929 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-05 11:29:08,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08 BoogieIcfgContainer [2019-09-05 11:29:08,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:08,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:08,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:08,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:08,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:07" (1/3) ... [2019-09-05 11:29:08,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187535a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (2/3) ... [2019-09-05 11:29:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187535a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08" (3/3) ... [2019-09-05 11:29:08,938 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2019-09-05 11:29:08,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:08,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:08,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:09,008 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:09,008 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:09,008 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:09,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:09,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:09,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:09,009 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:09,009 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:09,009 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-05 11:29:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:29:09,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,034 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -539958144, now seen corresponding path program 1 times [2019-09-05 11:29:09,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:29:09,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:09,345 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2019-09-05 11:29:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,516 INFO L93 Difference]: Finished difference Result 98 states and 149 transitions. [2019-09-05 11:29:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:09,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 11:29:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,529 INFO L225 Difference]: With dead ends: 98 [2019-09-05 11:29:09,529 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:29:09,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:29:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-05 11:29:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:29:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-09-05 11:29:09,584 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2019-09-05 11:29:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,585 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-09-05 11:29:09,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-09-05 11:29:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:29:09,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,587 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2104518782, now seen corresponding path program 1 times [2019-09-05 11:29:09,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:09,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:09,866 INFO L223 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-09-05 11:29:09,889 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-09-05 11:29:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:29:09,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,035 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 11 treesize of output 7 [2019-09-05 11:29:10,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:10,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:10,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:10,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-05 11:29:10,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 11:29:10,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:10,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:10,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:10,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 11:29:10,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:10,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-05 11:29:10,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:29:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:29:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:10,163 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 11 states. [2019-09-05 11:29:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,392 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2019-09-05 11:29:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:10,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-09-05 11:29:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,395 INFO L225 Difference]: With dead ends: 78 [2019-09-05 11:29:10,395 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 11:29:10,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 11:29:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-09-05 11:29:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:29:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-09-05 11:29:10,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2019-09-05 11:29:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,408 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-09-05 11:29:10,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:29:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-09-05 11:29:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:29:10,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,410 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1083450428, now seen corresponding path program 1 times [2019-09-05 11:29:10,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:29:10,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:29:10,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:29:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:10,486 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2019-09-05 11:29:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,521 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-09-05 11:29:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:29:10,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-05 11:29:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,528 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:29:10,529 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:29:10,530 INFO L628 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-09-05 11:29:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:29:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-05 11:29:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:29:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-09-05 11:29:10,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2019-09-05 11:29:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,545 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-09-05 11:29:10,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:29:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-09-05 11:29:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:29:10,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,550 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 3338338, now seen corresponding path program 1 times [2019-09-05 11:29:10,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,674 INFO L223 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-09-05 11:29:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:10,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-05 11:29:10,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:10,781 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 8 states. [2019-09-05 11:29:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,920 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-09-05 11:29:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:10,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-05 11:29:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,923 INFO L225 Difference]: With dead ends: 130 [2019-09-05 11:29:10,923 INFO L226 Difference]: Without dead ends: 94 [2019-09-05 11:29:10,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-05 11:29:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-09-05 11:29:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 11:29:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-09-05 11:29:10,952 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2019-09-05 11:29:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,952 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-09-05 11:29:10,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-09-05 11:29:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:29:10,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,957 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1687190263, now seen corresponding path program 1 times [2019-09-05 11:29:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:11,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,078 INFO L223 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) [2019-09-05 11:29:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:11,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-05 11:29:11,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:11,210 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 10 states. [2019-09-05 11:29:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,524 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2019-09-05 11:29:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:11,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-05 11:29:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,526 INFO L225 Difference]: With dead ends: 195 [2019-09-05 11:29:11,527 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 11:29:11,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 11:29:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2019-09-05 11:29:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 11:29:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2019-09-05 11:29:11,553 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2019-09-05 11:29:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,553 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-09-05 11:29:11,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2019-09-05 11:29:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:29:11,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,559 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1281163029, now seen corresponding path program 1 times [2019-09-05 11:29:11,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:11,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,279 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2019-09-05 11:29:12,476 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 51 [2019-09-05 11:29:12,858 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2019-09-05 11:29:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:13,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:13,097 INFO L223 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-09-05 11:29:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:13,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:29:13,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:13,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:13,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:29:13,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:13,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-09-05 11:29:13,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-05 11:29:13,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,253 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-09-05 11:29:13,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2019-09-05 11:29:13,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:13,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 99 [2019-09-05 11:29:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:13,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,433 INFO L567 ElimStorePlain]: treesize reduction 63, result has 37.0 percent of original size [2019-09-05 11:29:13,435 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 1 xjuncts. [2019-09-05 11:29:13,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2019-09-05 11:29:13,570 INFO L341 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2019-09-05 11:29:13,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2019-09-05 11:29:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:13,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,583 INFO L567 ElimStorePlain]: treesize reduction 6, result has 64.7 percent of original size [2019-09-05 11:29:13,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:13,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:3 [2019-09-05 11:29:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:13,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:13,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2019-09-05 11:29:13,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:29:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:29:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:29:13,643 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 25 states. [2019-09-05 11:29:14,406 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-05 11:29:14,567 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-05 11:29:16,222 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-05 11:29:17,484 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-05 11:29:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:18,430 INFO L93 Difference]: Finished difference Result 241 states and 312 transitions. [2019-09-05 11:29:18,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:29:18,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-05 11:29:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:18,433 INFO L225 Difference]: With dead ends: 241 [2019-09-05 11:29:18,434 INFO L226 Difference]: Without dead ends: 239 [2019-09-05 11:29:18,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=703, Invalid=2489, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:29:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-05 11:29:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 89. [2019-09-05 11:29:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 11:29:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2019-09-05 11:29:18,458 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 31 [2019-09-05 11:29:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:18,459 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2019-09-05 11:29:18,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:29:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2019-09-05 11:29:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:29:18,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:18,461 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:18,461 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1972596862, now seen corresponding path program 2 times [2019-09-05 11:29:18,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:29:18,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:18,711 INFO L223 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-09-05 11:29:18,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:18,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:18,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:18,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:29:18,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:18,812 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-09-05 11:29:18,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-05 11:29:18,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-09-05 11:29:18,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-09-05 11:29:18,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 11:29:18,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 11:29:18,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:29:18,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:18,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-09-05 11:29:18,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:29:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:29:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:29:18,941 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 18 states. [2019-09-05 11:29:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:19,532 INFO L93 Difference]: Finished difference Result 309 states and 409 transitions. [2019-09-05 11:29:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:29:19,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-09-05 11:29:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:19,538 INFO L225 Difference]: With dead ends: 309 [2019-09-05 11:29:19,538 INFO L226 Difference]: Without dead ends: 233 [2019-09-05 11:29:19,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:29:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-05 11:29:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 104. [2019-09-05 11:29:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 11:29:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-09-05 11:29:19,562 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 31 [2019-09-05 11:29:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:19,562 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-09-05 11:29:19,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:29:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-09-05 11:29:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:29:19,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:19,564 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:19,564 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1698114635, now seen corresponding path program 1 times [2019-09-05 11:29:19,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:19,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:19,621 INFO L223 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-09-05 11:29:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:19,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:19,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-05 11:29:19,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:19,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-05 11:29:19,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:19,730 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 10 states. [2019-09-05 11:29:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:19,891 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2019-09-05 11:29:19,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:19,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-09-05 11:29:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:19,893 INFO L225 Difference]: With dead ends: 225 [2019-09-05 11:29:19,893 INFO L226 Difference]: Without dead ends: 156 [2019-09-05 11:29:19,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:29:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-05 11:29:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 112. [2019-09-05 11:29:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 11:29:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-09-05 11:29:19,909 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 33 [2019-09-05 11:29:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:19,910 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-09-05 11:29:19,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2019-09-05 11:29:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:29:19,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:19,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:19,912 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1142223879, now seen corresponding path program 2 times [2019-09-05 11:29:19,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:19,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:19,982 INFO L223 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-09-05 11:29:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:20,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:20,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:20,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:20,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:20,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:20,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-05 11:29:20,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:20,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:20,090 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 10 states. [2019-09-05 11:29:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:20,309 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2019-09-05 11:29:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:20,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-05 11:29:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:20,312 INFO L225 Difference]: With dead ends: 216 [2019-09-05 11:29:20,312 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 11:29:20,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 11:29:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2019-09-05 11:29:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 11:29:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2019-09-05 11:29:20,338 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 34 [2019-09-05 11:29:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:20,339 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2019-09-05 11:29:20,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2019-09-05 11:29:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:29:20,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:20,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:20,343 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1647290398, now seen corresponding path program 3 times [2019-09-05 11:29:20,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:20,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:21,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:21,526 INFO L223 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-09-05 11:29:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:21,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:29:21,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:21,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:29:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:21,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:21,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:29:21,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:21,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:21,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:21,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2019-09-05 11:29:21,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:21,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-09-05 11:29:21,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:21,728 INFO L567 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-09-05 11:29:21,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:21,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2019-09-05 11:29:21,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:21,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:22,024 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-05 11:29:22,025 INFO L341 Elim1Store]: treesize reduction 8, result has 95.8 percent of original size [2019-09-05 11:29:22,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 207 [2019-09-05 11:29:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,110 INFO L567 ElimStorePlain]: treesize reduction 203, result has 20.4 percent of original size [2019-09-05 11:29:22,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2019-09-05 11:29:22,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 240 [2019-09-05 11:29:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,561 INFO L567 ElimStorePlain]: treesize reduction 177, result has 25.9 percent of original size [2019-09-05 11:29:22,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:61 [2019-09-05 11:29:22,838 INFO L341 Elim1Store]: treesize reduction 28, result has 71.1 percent of original size [2019-09-05 11:29:22,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 97 [2019-09-05 11:29:22,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,863 INFO L567 ElimStorePlain]: treesize reduction 32, result has 30.4 percent of original size [2019-09-05 11:29:22,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-09-05 11:29:22,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:22,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:22,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2019-09-05 11:29:22,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:29:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:29:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:29:22,949 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand 32 states. [2019-09-05 11:29:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:25,352 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2019-09-05 11:29:25,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:29:25,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2019-09-05 11:29:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:25,354 INFO L225 Difference]: With dead ends: 211 [2019-09-05 11:29:25,354 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 11:29:25,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:29:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 11:29:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2019-09-05 11:29:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 11:29:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2019-09-05 11:29:25,368 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 37 [2019-09-05 11:29:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:25,369 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2019-09-05 11:29:25,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:29:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2019-09-05 11:29:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:29:25,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:25,370 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:25,370 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1829186791, now seen corresponding path program 1 times [2019-09-05 11:29:25,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:25,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:25,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-05 11:29:25,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:25,410 INFO L223 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-09-05 11:29:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:25,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:25,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 11:29:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-05 11:29:25,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:29:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:29:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:25,493 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand 7 states. [2019-09-05 11:29:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:25,593 INFO L93 Difference]: Finished difference Result 226 states and 289 transitions. [2019-09-05 11:29:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:25,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-09-05 11:29:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:25,595 INFO L225 Difference]: With dead ends: 226 [2019-09-05 11:29:25,595 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 11:29:25,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:29:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 11:29:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2019-09-05 11:29:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 11:29:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2019-09-05 11:29:25,618 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 37 [2019-09-05 11:29:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:25,618 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2019-09-05 11:29:25,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:29:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2019-09-05 11:29:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:29:25,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:25,620 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:25,620 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2064143268, now seen corresponding path program 3 times [2019-09-05 11:29:25,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:25,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 11:29:25,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:25,678 INFO L223 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) [2019-09-05 11:29:25,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:25,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:29:25,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:25,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:29:25,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:25,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:29:25,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-09-05 11:29:25,802 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-09-05 11:29:25,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 11:29:25,856 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-05 11:29:25,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-09-05 11:29:25,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:25,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:25,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-09-05 11:29:26,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:26,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-09-05 11:29:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:26,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 11:29:26,080 INFO L567 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2019-09-05 11:29:26,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:26,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-09-05 11:29:26,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 11:29:26,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:26,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17] total 20 [2019-09-05 11:29:26,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:29:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:29:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:26,127 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand 20 states. [2019-09-05 11:29:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:27,675 INFO L93 Difference]: Finished difference Result 401 states and 504 transitions. [2019-09-05 11:29:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:29:27,676 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-09-05 11:29:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:27,678 INFO L225 Difference]: With dead ends: 401 [2019-09-05 11:29:27,679 INFO L226 Difference]: Without dead ends: 295 [2019-09-05 11:29:27,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:29:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-05 11:29:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 147. [2019-09-05 11:29:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-05 11:29:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2019-09-05 11:29:27,700 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 37 [2019-09-05 11:29:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:27,701 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2019-09-05 11:29:27,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:29:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2019-09-05 11:29:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:29:27,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:27,702 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:27,702 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2011969310, now seen corresponding path program 4 times [2019-09-05 11:29:27,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:27,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:27,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:27,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:27,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:27,779 INFO L223 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-09-05 11:29:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:27,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:27,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:27,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:29:27,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:27,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:27,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-09-05 11:29:27,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:29:27,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:29:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:27,907 INFO L87 Difference]: Start difference. First operand 147 states and 183 transitions. Second operand 14 states. [2019-09-05 11:29:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:28,315 INFO L93 Difference]: Finished difference Result 367 states and 462 transitions. [2019-09-05 11:29:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:28,315 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-05 11:29:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:28,317 INFO L225 Difference]: With dead ends: 367 [2019-09-05 11:29:28,317 INFO L226 Difference]: Without dead ends: 345 [2019-09-05 11:29:28,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-05 11:29:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 162. [2019-09-05 11:29:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-05 11:29:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 202 transitions. [2019-09-05 11:29:28,340 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 202 transitions. Word has length 37 [2019-09-05 11:29:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:28,340 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 202 transitions. [2019-09-05 11:29:28,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:29:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2019-09-05 11:29:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:29:28,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:28,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:28,341 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1447053639, now seen corresponding path program 1 times [2019-09-05 11:29:28,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:28,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:29:28,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:28,505 INFO L223 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) [2019-09-05 11:29:28,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:28,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:29:28,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:28,648 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-09-05 11:29:28,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:28,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:28,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:28,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-05 11:29:28,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 11:29:28,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:28,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:28,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:28,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 11:29:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:29:28,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:28,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2019-09-05 11:29:28,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:29:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:29:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:28,902 INFO L87 Difference]: Start difference. First operand 162 states and 202 transitions. Second operand 16 states. [2019-09-05 11:29:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:29,479 INFO L93 Difference]: Finished difference Result 278 states and 346 transitions. [2019-09-05 11:29:29,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:29:29,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-09-05 11:29:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:29,481 INFO L225 Difference]: With dead ends: 278 [2019-09-05 11:29:29,481 INFO L226 Difference]: Without dead ends: 276 [2019-09-05 11:29:29,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:29:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-05 11:29:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 223. [2019-09-05 11:29:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 11:29:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2019-09-05 11:29:29,514 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 39 [2019-09-05 11:29:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:29,515 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2019-09-05 11:29:29,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:29:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2019-09-05 11:29:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:29:29,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:29,517 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:29,517 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1460763138, now seen corresponding path program 4 times [2019-09-05 11:29:29,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:29,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:29,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:29,585 INFO L223 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-09-05 11:29:29,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:29,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:29,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:29,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:29,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:29,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-05 11:29:29,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:29,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:29,707 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 13 states. [2019-09-05 11:29:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:30,122 INFO L93 Difference]: Finished difference Result 498 states and 631 transitions. [2019-09-05 11:29:30,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:29:30,123 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-05 11:29:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:30,126 INFO L225 Difference]: With dead ends: 498 [2019-09-05 11:29:30,126 INFO L226 Difference]: Without dead ends: 458 [2019-09-05 11:29:30,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:29:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-05 11:29:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 298. [2019-09-05 11:29:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-05 11:29:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 383 transitions. [2019-09-05 11:29:30,168 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 383 transitions. Word has length 40 [2019-09-05 11:29:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:30,169 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 383 transitions. [2019-09-05 11:29:30,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 383 transitions. [2019-09-05 11:29:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:29:30,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:30,170 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:30,170 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1031836921, now seen corresponding path program 2 times [2019-09-05 11:29:30,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:30,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:30,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:30,503 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-05 11:29:30,623 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-05 11:29:30,748 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-05 11:29:31,022 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 46 [2019-09-05 11:29:31,316 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2019-09-05 11:29:31,512 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 42 [2019-09-05 11:29:31,940 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 47 [2019-09-05 11:29:32,124 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2019-09-05 11:29:32,275 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2019-09-05 11:29:32,591 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-05 11:29:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:32,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:32,855 INFO L223 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-09-05 11:29:32,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:32,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:32,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:32,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:29:32,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:32,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:32,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:29:32,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:32,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:32,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:32,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-09-05 11:29:32,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-05 11:29:32,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,016 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-09-05 11:29:33,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2019-09-05 11:29:33,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:33,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:33,117 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 1 case distinctions, treesize of input 28 treesize of output 38 [2019-09-05 11:29:33,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,135 INFO L567 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-09-05 11:29:33,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-09-05 11:29:33,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:33,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 83 [2019-09-05 11:29:33,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,319 INFO L567 ElimStorePlain]: treesize reduction 52, result has 38.1 percent of original size [2019-09-05 11:29:33,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2019-09-05 11:29:33,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:33,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:33,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 119 [2019-09-05 11:29:33,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,536 INFO L567 ElimStorePlain]: treesize reduction 63, result has 31.5 percent of original size [2019-09-05 11:29:33,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:33,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:29 [2019-09-05 11:29:33,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:33,671 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 31 treesize of output 23 [2019-09-05 11:29:33,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:33,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:33,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-09-05 11:29:33,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:33,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 36 [2019-09-05 11:29:33,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:29:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:29:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:29:33,757 INFO L87 Difference]: Start difference. First operand 298 states and 383 transitions. Second operand 36 states. [2019-09-05 11:29:34,218 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-09-05 11:29:34,847 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-09-05 11:29:35,651 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-09-05 11:29:35,930 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-09-05 11:29:36,075 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-09-05 11:29:36,374 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 57 [2019-09-05 11:29:36,524 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-09-05 11:29:36,775 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-09-05 11:29:37,062 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-05 11:29:37,482 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-05 11:29:37,631 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-09-05 11:29:37,827 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2019-09-05 11:29:37,999 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-09-05 11:29:38,286 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-05 11:29:38,515 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-05 11:29:40,094 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-09-05 11:29:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:40,929 INFO L93 Difference]: Finished difference Result 628 states and 817 transitions. [2019-09-05 11:29:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:29:40,930 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-09-05 11:29:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:40,933 INFO L225 Difference]: With dead ends: 628 [2019-09-05 11:29:40,934 INFO L226 Difference]: Without dead ends: 626 [2019-09-05 11:29:40,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1050, Invalid=4352, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 11:29:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-05 11:29:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 355. [2019-09-05 11:29:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-05 11:29:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 459 transitions. [2019-09-05 11:29:40,991 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 459 transitions. Word has length 40 [2019-09-05 11:29:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:40,992 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 459 transitions. [2019-09-05 11:29:40,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:29:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 459 transitions. [2019-09-05 11:29:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:29:40,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:40,993 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-05 11:29:40,993 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:40,994 INFO L82 PathProgramCache]: Analyzing trace with hash 930411959, now seen corresponding path program 5 times [2019-09-05 11:29:40,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:40,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:40,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:41,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:41,093 INFO L223 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-09-05 11:29:41,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:29:41,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-05 11:29:41,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:41,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:29:41,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-09-05 11:29:41,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:29:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:29:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:41,232 INFO L87 Difference]: Start difference. First operand 355 states and 459 transitions. Second operand 16 states. [2019-09-05 11:29:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:41,872 INFO L93 Difference]: Finished difference Result 857 states and 1106 transitions. [2019-09-05 11:29:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:29:41,872 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-09-05 11:29:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:41,879 INFO L225 Difference]: With dead ends: 857 [2019-09-05 11:29:41,879 INFO L226 Difference]: Without dead ends: 799 [2019-09-05 11:29:41,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:29:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-05 11:29:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 400. [2019-09-05 11:29:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-05 11:29:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 520 transitions. [2019-09-05 11:29:41,967 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 520 transitions. Word has length 40 [2019-09-05 11:29:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:41,967 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 520 transitions. [2019-09-05 11:29:41,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:29:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 520 transitions. [2019-09-05 11:29:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:29:41,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:41,970 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-05 11:29:41,970 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1598984565, now seen corresponding path program 5 times [2019-09-05 11:29:41,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:41,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:41,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:43,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:43,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:29:44,106 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-05 11:29:44,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:44,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:29:44,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:44,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:29:44,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:39 [2019-09-05 11:29:44,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-09-05 11:29:44,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,228 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-09-05 11:29:44,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2019-09-05 11:29:44,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:44,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,600 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-05 11:29:44,601 INFO L341 Elim1Store]: treesize reduction 8, result has 96.7 percent of original size [2019-09-05 11:29:44,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 257 [2019-09-05 11:29:44,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,682 INFO L567 ElimStorePlain]: treesize reduction 225, result has 23.5 percent of original size [2019-09-05 11:29:44,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:44,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:68 [2019-09-05 11:29:44,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:44,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:29:44,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:45,078 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-09-05 11:29:45,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:45,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 79 treesize of output 396 [2019-09-05 11:29:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:45,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:45,208 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 42 [2019-09-05 11:29:45,208 INFO L567 ElimStorePlain]: treesize reduction 464, result has 15.0 percent of original size [2019-09-05 11:29:45,210 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 1 xjuncts. [2019-09-05 11:29:45,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:80 [2019-09-05 11:29:45,664 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-05 11:29:45,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:45,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:45,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:46,083 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-05 11:29:46,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:46,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 453 [2019-09-05 11:29:46,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:46,271 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2019-09-05 11:29:46,271 INFO L567 ElimStorePlain]: treesize reduction 390, result has 20.2 percent of original size [2019-09-05 11:29:46,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:46,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:105, output treesize:97 [2019-09-05 11:29:56,402 WARN L188 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-05 11:30:02,544 WARN L188 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-05 11:30:08,663 WARN L188 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-05 11:30:14,785 WARN L188 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-05 11:30:21,193 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-05 11:30:21,193 INFO L341 Elim1Store]: treesize reduction 42, result has 79.1 percent of original size [2019-09-05 11:30:21,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 198 [2019-09-05 11:30:21,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:21,250 INFO L567 ElimStorePlain]: treesize reduction 78, result has 17.9 percent of original size [2019-09-05 11:30:21,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:21,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:90, output treesize:3 [2019-09-05 11:30:21,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:21,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2019-09-05 11:30:21,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:30:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:30:21,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1654, Unknown=5, NotChecked=0, Total=1892 [2019-09-05 11:30:21,372 INFO L87 Difference]: Start difference. First operand 400 states and 520 transitions. Second operand 44 states. [2019-09-05 11:30:23,383 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-05 11:30:29,074 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-09-05 11:30:31,347 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-09-05 11:30:31,916 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-05 11:30:32,961 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-05 11:30:33,656 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-05 11:30:34,419 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-05 11:30:35,122 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-05 11:30:37,410 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-09-05 11:30:38,216 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-09-05 11:30:40,487 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-05 11:30:41,064 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-05 11:30:43,371 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-09-05 11:30:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:43,383 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2019-09-05 11:30:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:30:43,383 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-09-05 11:30:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:43,385 INFO L225 Difference]: With dead ends: 471 [2019-09-05 11:30:43,385 INFO L226 Difference]: Without dead ends: 421 [2019-09-05 11:30:43,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=759, Invalid=4490, Unknown=7, NotChecked=0, Total=5256 [2019-09-05 11:30:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-05 11:30:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 403. [2019-09-05 11:30:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-05 11:30:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 524 transitions. [2019-09-05 11:30:43,441 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 524 transitions. Word has length 43 [2019-09-05 11:30:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:43,441 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 524 transitions. [2019-09-05 11:30:43,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:30:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 524 transitions. [2019-09-05 11:30:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:30:43,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:43,442 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:43,443 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1423252674, now seen corresponding path program 6 times [2019-09-05 11:30:43,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:43,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:43,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-05 11:30:43,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:43,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:30:43,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-05 11:30:43,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:43,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:30:43,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:44,005 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-09-05 11:30:44,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:44,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-05 11:30:44,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-05 11:30:44,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,100 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-09-05 11:30:44,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2019-09-05 11:30:44,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:44,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:30:44,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:44,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:44,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2019-09-05 11:30:44,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:44,290 INFO L341 Elim1Store]: treesize reduction 30, result has 74.6 percent of original size [2019-09-05 11:30:44,291 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 6 case distinctions, treesize of input 46 treesize of output 105 [2019-09-05 11:30:44,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:44,330 INFO L567 ElimStorePlain]: treesize reduction 68, result has 46.0 percent of original size [2019-09-05 11:30:44,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:44,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:58 [2019-09-05 11:30:46,370 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-05 11:30:46,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:52,843 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 11:30:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:59,813 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-05 11:30:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:09,905 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-05 11:31:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:21,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:21,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:21,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:21,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:21,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:21,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 25 [2019-09-05 11:31:21,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:21,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:21,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:21,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:3 [2019-09-05 11:31:21,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 5 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:31:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:21,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-09-05 11:31:21,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:31:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:31:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=942, Unknown=16, NotChecked=0, Total=1056 [2019-09-05 11:31:21,575 INFO L87 Difference]: Start difference. First operand 403 states and 524 transitions. Second operand 33 states. [2019-09-05 11:31:38,269 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-05 11:31:49,725 WARN L188 SmtUtils]: Spent 8.72 s on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-09-05 11:31:53,776 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-05 11:31:58,681 WARN L188 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-09-05 11:32:28,066 WARN L188 SmtUtils]: Spent 18.14 s on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2019-09-05 11:32:32,359 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-05 11:32:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:45,716 INFO L93 Difference]: Finished difference Result 795 states and 1055 transitions. [2019-09-05 11:32:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:32:45,716 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-09-05 11:32:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:45,722 INFO L225 Difference]: With dead ends: 795 [2019-09-05 11:32:45,722 INFO L226 Difference]: Without dead ends: 793 [2019-09-05 11:32:45,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 100.0s TimeCoverageRelationStatistics Valid=459, Invalid=2932, Unknown=31, NotChecked=0, Total=3422 [2019-09-05 11:32:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-05 11:32:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 366. [2019-09-05 11:32:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-05 11:32:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 483 transitions. [2019-09-05 11:32:45,785 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 483 transitions. Word has length 43 [2019-09-05 11:32:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:45,786 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 483 transitions. [2019-09-05 11:32:45,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:32:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 483 transitions. [2019-09-05 11:32:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:32:45,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:45,787 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:45,787 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash 229619440, now seen corresponding path program 2 times [2019-09-05 11:32:45,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:45,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:45,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:32:45,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:45,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:32:45,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:32:45,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:45,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:32:45,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:32:45,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:45,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-05 11:32:45,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:32:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:32:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:32:45,943 INFO L87 Difference]: Start difference. First operand 366 states and 483 transitions. Second operand 13 states. [2019-09-05 11:32:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:46,286 INFO L93 Difference]: Finished difference Result 898 states and 1182 transitions. [2019-09-05 11:32:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:32:46,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-09-05 11:32:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:46,291 INFO L225 Difference]: With dead ends: 898 [2019-09-05 11:32:46,291 INFO L226 Difference]: Without dead ends: 713 [2019-09-05 11:32:46,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:32:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-09-05 11:32:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 557. [2019-09-05 11:32:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-05 11:32:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 744 transitions. [2019-09-05 11:32:46,406 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 744 transitions. Word has length 47 [2019-09-05 11:32:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:46,406 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 744 transitions. [2019-09-05 11:32:46,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:32:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 744 transitions. [2019-09-05 11:32:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:32:46,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:46,407 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2019-09-05 11:32:46,408 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2061264985, now seen corresponding path program 6 times [2019-09-05 11:32:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:46,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:32:46,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:46,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:32:46,591 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-05 11:32:46,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:46,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:32:46,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:32:46,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:46,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-09-05 11:32:46,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:32:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:32:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:32:46,675 INFO L87 Difference]: Start difference. First operand 557 states and 744 transitions. Second operand 16 states. [2019-09-05 11:32:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:47,361 INFO L93 Difference]: Finished difference Result 1287 states and 1703 transitions. [2019-09-05 11:32:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:32:47,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2019-09-05 11:32:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:47,368 INFO L225 Difference]: With dead ends: 1287 [2019-09-05 11:32:47,369 INFO L226 Difference]: Without dead ends: 1249 [2019-09-05 11:32:47,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:32:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-09-05 11:32:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2019-09-05 11:32:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-09-05 11:32:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1074 transitions. [2019-09-05 11:32:47,522 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1074 transitions. Word has length 46 [2019-09-05 11:32:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:47,522 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1074 transitions. [2019-09-05 11:32:47,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:32:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1074 transitions. [2019-09-05 11:32:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:32:47,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:47,525 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:47,525 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -61492290, now seen corresponding path program 3 times [2019-09-05 11:32:47,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:47,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-05 11:32:47,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:47,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:47,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:32:47,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:32:47,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:47,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:32:47,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-05 11:32:47,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:47,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-05 11:32:47,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:32:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:32:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:32:47,718 INFO L87 Difference]: Start difference. First operand 784 states and 1074 transitions. Second operand 10 states. [2019-09-05 11:32:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:48,229 INFO L93 Difference]: Finished difference Result 1344 states and 1828 transitions. [2019-09-05 11:32:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:32:48,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-09-05 11:32:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:48,235 INFO L225 Difference]: With dead ends: 1344 [2019-09-05 11:32:48,235 INFO L226 Difference]: Without dead ends: 901 [2019-09-05 11:32:48,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:32:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-05 11:32:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 833. [2019-09-05 11:32:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-05 11:32:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1093 transitions. [2019-09-05 11:32:48,420 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1093 transitions. Word has length 46 [2019-09-05 11:32:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:48,421 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1093 transitions. [2019-09-05 11:32:48,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:32:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1093 transitions. [2019-09-05 11:32:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:32:48,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:48,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:48,423 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1112882494, now seen corresponding path program 1 times [2019-09-05 11:32:48,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:48,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:48,968 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-09-05 11:32:49,103 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-09-05 11:32:49,227 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2019-09-05 11:32:49,384 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 41 [2019-09-05 11:32:49,639 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 57 [2019-09-05 11:32:49,906 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 54 [2019-09-05 11:32:50,159 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-05 11:32:50,399 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-05 11:32:50,730 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2019-09-05 11:32:51,042 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 73 [2019-09-05 11:32:51,297 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2019-09-05 11:32:51,461 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-05 11:32:51,833 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2019-09-05 11:32:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:32:52,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:52,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:32:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:52,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:32:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:52,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:52,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-09-05 11:32:52,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:52,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:60 [2019-09-05 11:32:52,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:52,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 50 [2019-09-05 11:32:52,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,441 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2019-09-05 11:32:52,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:67 [2019-09-05 11:32:52,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:52,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:52,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 66 [2019-09-05 11:32:52,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,693 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-09-05 11:32:52,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:52,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:57 [2019-09-05 11:32:53,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:53,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 111 [2019-09-05 11:32:53,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:53,113 INFO L567 ElimStorePlain]: treesize reduction 56, result has 54.8 percent of original size [2019-09-05 11:32:53,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:53,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:68 [2019-09-05 11:32:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:32:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 36 [2019-09-05 11:32:53,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:32:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:32:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:32:53,404 INFO L87 Difference]: Start difference. First operand 833 states and 1093 transitions. Second operand 36 states. [2019-09-05 11:32:54,255 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-05 11:32:54,602 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-09-05 11:32:54,789 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-05 11:32:54,964 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-05 11:32:55,455 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-05 11:32:55,632 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-05 11:32:56,097 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-05 11:32:56,447 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-05 11:32:56,798 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-05 11:32:57,232 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-05 11:32:57,693 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-05 11:32:57,944 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2019-09-05 11:32:58,183 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 54 [2019-09-05 11:32:58,453 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-09-05 11:32:58,941 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2019-09-05 11:32:59,300 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-05 11:32:59,455 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-05 11:32:59,853 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2019-09-05 11:33:00,040 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-05 11:33:00,519 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-05 11:33:00,731 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 52 [2019-09-05 11:33:00,910 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-05 11:33:01,134 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-05 11:33:01,364 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-05 11:33:01,728 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-09-05 11:33:02,029 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-05 11:33:02,349 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-05 11:33:02,725 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-05 11:33:03,711 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-05 11:33:04,014 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 59 [2019-09-05 11:33:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:04,863 INFO L93 Difference]: Finished difference Result 1071 states and 1360 transitions. [2019-09-05 11:33:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 11:33:04,864 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2019-09-05 11:33:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:04,868 INFO L225 Difference]: With dead ends: 1071 [2019-09-05 11:33:04,869 INFO L226 Difference]: Without dead ends: 970 [2019-09-05 11:33:04,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2593 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1040, Invalid=8080, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 11:33:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-05 11:33:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 839. [2019-09-05 11:33:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-05 11:33:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1095 transitions. [2019-09-05 11:33:05,030 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1095 transitions. Word has length 48 [2019-09-05 11:33:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:05,031 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1095 transitions. [2019-09-05 11:33:05,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:33:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1095 transitions. [2019-09-05 11:33:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:33:05,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:05,033 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:05,033 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 978868988, now seen corresponding path program 1 times [2019-09-05 11:33:05,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:05,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:33:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 11:33:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 11:33:05,147 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-05 11:33:05,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:33:05 BoogieIcfgContainer [2019-09-05 11:33:05,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:33:05,240 INFO L168 Benchmark]: Toolchain (without parser) took 237265.11 ms. Allocated memory was 140.5 MB in the beginning and 377.0 MB in the end (delta: 236.5 MB). Free memory was 86.6 MB in the beginning and 247.2 MB in the end (delta: -160.6 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,241 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.00 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 86.4 MB in the beginning and 178.4 MB in the end (delta: -92.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,243 INFO L168 Benchmark]: Boogie Preprocessor took 55.97 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 175.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,243 INFO L168 Benchmark]: RCFGBuilder took 486.84 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 154.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,244 INFO L168 Benchmark]: TraceAbstraction took 236306.12 ms. Allocated memory was 200.8 MB in the beginning and 377.0 MB in the end (delta: 176.2 MB). Free memory was 153.6 MB in the beginning and 247.2 MB in the end (delta: -93.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-09-05 11:33:05,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 411.00 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 86.4 MB in the beginning and 178.4 MB in the end (delta: -92.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.97 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 175.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 486.84 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 154.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236306.12 ms. Allocated memory was 200.8 MB in the beginning and 377.0 MB in the end (delta: 176.2 MB). Free memory was 153.6 MB in the beginning and 247.2 MB in the end (delta: -93.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int INFINITY = 899; VAL [\old(INFINITY)=902, INFINITY=899] [L13] int nodecount = __VERIFIER_nondet_int(); [L14] int edgecount = __VERIFIER_nondet_int(); [L15] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L16] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L17] int source = 0; [L18] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L19] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L20] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L21] int distance[5]; [L22] int x,y; [L23] int i,j; [L25] i = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L25] COND TRUE i < nodecount VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L26] COND TRUE i == source [L27] distance[i] = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={-3:0}, source=0, Weight={1:0}] [L25] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L25] COND TRUE i < nodecount VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={-3:0}, source=0, Weight={1:0}] [L26] COND FALSE !(i == source) [L30] distance[i] = INFINITY VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L25] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={-3:0}, source=0, Weight={1:0}] [L25] COND FALSE !(i < nodecount) VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={-3:0}, source=0, Weight={1:0}] [L34] i = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={-3:0}, Weight={1:0}] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={-4:0}, distance={-2:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, Weight[j]=0, x=1, y=0] [L40] COND TRUE distance[x] > distance[y] + Weight[j] [L42] distance[x] = -1 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L36] j++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L34] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={-4:0}, distance={-2:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, Weight[j]=0, x=1, y=0] [L40] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L36] j++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L34] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L34] COND FALSE !(i < nodecount) VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L46] i = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L46] COND TRUE i < edgecount [L48] EXPR Dest[i] [L48] x = Dest[i] [L49] EXPR Source[i] [L49] y = Source[i] [L50] EXPR distance[x] [L50] EXPR distance[y] [L50] EXPR Weight[i] VAL [Dest={-4:0}, distance={-2:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, Weight[i]=0, x=1, y=0] [L50] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L46] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L46] COND FALSE !(i < edgecount) VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L56] i = 0 VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={-4:0}, distance={-2:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L6] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L58] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={-4:0}, distance={-2:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={-3:0}, source=0, Weight={1:0}, x=1, y=0] [L56] i++ VAL [Dest={-4:0}, distance={-2:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={-4:0}, distance={-2:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={-3:0}, Weight={1:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 236.2s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 139.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1148 SDtfs, 4912 SDslu, 7160 SDs, 0 SdLazy, 10882 SolverSat, 2921 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1359 GetRequests, 667 SyntacticMatches, 20 SemanticMatches, 672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8668 ImplicationChecksByTransitivity, 189.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 3031 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 92.7s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1666 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1580 ConstructedInterpolants, 105 QuantifiedInterpolants, 793230 SizeOfPredicates, 171 NumberOfNonLiveVariables, 5474 ConjunctsInSsa, 389 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 316/776 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...