java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_09.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:42:30,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:42:30,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:42:30,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:42:30,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:42:30,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:42:30,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:42:30,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:42:30,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:42:30,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:42:30,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:42:30,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:42:30,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:42:30,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:42:30,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:42:30,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:42:30,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:42:30,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:42:30,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:42:30,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:42:30,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:42:30,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:42:30,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:42:30,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:42:30,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:42:30,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:42:30,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:42:30,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:42:30,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:42:30,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:42:30,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:42:30,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:42:30,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:42:30,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:42:30,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:42:30,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:42:30,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:42:30,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:42:30,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:42:30,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:42:30,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:42:30,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:42:30,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:42:30,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:42:30,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:42:30,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:42:30,927 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:42:30,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:42:30,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:42:30,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:42:30,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:42:30,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:42:30,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:42:30,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:42:30,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:42:30,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:42:30,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:42:30,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:42:30,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:42:30,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:42:30,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:42:30,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:42:30,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:42:30,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:42:30,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:42:30,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:42:30,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:42:30,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:42:31,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:42:31,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:42:31,003 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:42:31,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_09.i [2019-10-01 23:42:31,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc3f9970/710c9908d751466eb77fad63c85e763f/FLAG5ab7633ed [2019-10-01 23:42:31,480 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:42:31,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_09.i [2019-10-01 23:42:31,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc3f9970/710c9908d751466eb77fad63c85e763f/FLAG5ab7633ed [2019-10-01 23:42:31,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc3f9970/710c9908d751466eb77fad63c85e763f [2019-10-01 23:42:31,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:42:31,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:42:31,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:42:31,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:42:31,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:42:31,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:42:31" (1/1) ... [2019-10-01 23:42:31,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2f29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:31, skipping insertion in model container [2019-10-01 23:42:31,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:42:31" (1/1) ... [2019-10-01 23:42:31,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:42:31,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:42:32,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:42:32,147 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:42:32,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:42:32,282 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:42:32,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32 WrapperNode [2019-10-01 23:42:32,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:42:32,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:42:32,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:42:32,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:42:32,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... [2019-10-01 23:42:32,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:42:32,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:42:32,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:42:32,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:42:32,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:42:32,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:42:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:42:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:42:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:42:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:42:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:42:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:42:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:42:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:42:32,614 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:42:32,614 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:42:32,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:42:32 BoogieIcfgContainer [2019-10-01 23:42:32,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:42:32,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:42:32,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:42:32,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:42:32,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:42:31" (1/3) ... [2019-10-01 23:42:32,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f6963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:42:32, skipping insertion in model container [2019-10-01 23:42:32,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:32" (2/3) ... [2019-10-01 23:42:32,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f6963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:42:32, skipping insertion in model container [2019-10-01 23:42:32,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:42:32" (3/3) ... [2019-10-01 23:42:32,624 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_09.i [2019-10-01 23:42:32,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:42:32,643 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:42:32,665 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:42:32,700 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:42:32,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:42:32,701 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:42:32,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:42:32,701 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:42:32,701 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:42:32,701 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:42:32,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:42:32,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:42:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-01 23:42:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:42:32,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:32,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:32,731 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-10-01 23:42:32,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:32,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:42:32,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:42:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:42:32,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:42:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:42:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:42:32,909 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-10-01 23:42:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:32,933 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-01 23:42:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:42:32,935 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:42:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:32,944 INFO L225 Difference]: With dead ends: 41 [2019-10-01 23:42:32,944 INFO L226 Difference]: Without dead ends: 19 [2019-10-01 23:42:32,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:42:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-01 23:42:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-01 23:42:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-01 23:42:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-01 23:42:32,993 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-10-01 23:42:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:32,994 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-01 23:42:32,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:42:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-01 23:42:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:42:32,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:32,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:32,996 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-10-01 23:42:32,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:32,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:42:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:42:33,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:42:33,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:42:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:42:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:42:33,122 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-10-01 23:42:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:33,194 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-10-01 23:42:33,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:42:33,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:42:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:33,195 INFO L225 Difference]: With dead ends: 32 [2019-10-01 23:42:33,195 INFO L226 Difference]: Without dead ends: 20 [2019-10-01 23:42:33,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:42:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-01 23:42:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-01 23:42:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-01 23:42:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-01 23:42:33,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-10-01 23:42:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:33,203 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-01 23:42:33,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:42:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-01 23:42:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:42:33,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:33,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:33,206 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2019-10-01 23:42:33,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:33,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:42:33,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:42:33,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:42:33,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:42:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:42:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:42:33,286 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-10-01 23:42:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:33,315 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-01 23:42:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:42:33,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 23:42:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:33,319 INFO L225 Difference]: With dead ends: 34 [2019-10-01 23:42:33,319 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:42:33,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:42:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:42:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-01 23:42:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 23:42:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 23:42:33,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-10-01 23:42:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:33,331 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 23:42:33,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:42:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 23:42:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 23:42:33,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:33,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:33,333 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-10-01 23:42:33,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:33,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:42:33,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:33,409 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:33,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:33,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:42:33,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:42:33,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:33,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 23:42:33,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:42:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:42:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:42:33,558 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-10-01 23:42:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:33,654 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 23:42:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:42:33,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-01 23:42:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:33,656 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:42:33,656 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 23:42:33,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:42:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 23:42:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-01 23:42:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:42:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 23:42:33,663 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 23:42:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:33,663 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 23:42:33,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:42:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 23:42:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:42:33,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:33,664 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:33,665 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1897825622, now seen corresponding path program 2 times [2019-10-01 23:42:33,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:33,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:33,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:42:33,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:33,742 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:33,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:33,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:33,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:33,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:42:33,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:42:33,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:33,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-10-01 23:42:33,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:42:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:42:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:42:33,875 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 9 states. [2019-10-01 23:42:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:33,968 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-10-01 23:42:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:42:33,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-01 23:42:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:33,971 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:42:33,971 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 23:42:33,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:42:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 23:42:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-01 23:42:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:42:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 23:42:33,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2019-10-01 23:42:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:33,980 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 23:42:33,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:42:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 23:42:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:42:33,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:33,994 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:33,994 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1456795255, now seen corresponding path program 3 times [2019-10-01 23:42:33,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:33,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:42:34,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:34,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:34,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:42:34,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:34,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:42:34,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:42:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:42:34,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:42:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:42:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:42:34,150 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-10-01 23:42:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:34,226 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-01 23:42:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:42:34,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-01 23:42:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:34,228 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:42:34,228 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:42:34,228 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:42:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:42:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-01 23:42:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:42:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 23:42:34,235 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-10-01 23:42:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:34,235 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 23:42:34,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:42:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 23:42:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:42:34,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:34,237 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:34,237 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -33873434, now seen corresponding path program 4 times [2019-10-01 23:42:34,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:42:34,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:34,346 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:34,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:34,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:34,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:34,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:42:34,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:42:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-10-01 23:42:34,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:42:34,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:42:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:42:34,480 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 14 states. [2019-10-01 23:42:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:34,591 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-10-01 23:42:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:42:34,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-10-01 23:42:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:34,593 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:42:34,593 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 23:42:34,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:42:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 23:42:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-10-01 23:42:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:42:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-01 23:42:34,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 25 [2019-10-01 23:42:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:34,601 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-01 23:42:34,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:42:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-01 23:42:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 23:42:34,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:34,602 INFO L411 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:34,603 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1290022011, now seen corresponding path program 5 times [2019-10-01 23:42:34,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:34,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:42:34,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:34,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:35,038 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:42:35,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:35,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:42:35,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:42:35,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:35,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 19 [2019-10-01 23:42:35,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:42:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:42:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:42:35,167 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 19 states. [2019-10-01 23:42:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:35,361 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-10-01 23:42:35,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:42:35,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-01 23:42:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:35,364 INFO L225 Difference]: With dead ends: 76 [2019-10-01 23:42:35,364 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:42:35,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:42:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:42:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2019-10-01 23:42:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 23:42:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-01 23:42:35,378 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 31 [2019-10-01 23:42:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:35,378 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-01 23:42:35,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:42:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-01 23:42:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:42:35,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:35,381 INFO L411 BasicCegarLoop]: trace histogram [16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:35,381 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 678305990, now seen corresponding path program 6 times [2019-10-01 23:42:35,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:35,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:35,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:35,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:42:35,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:35,521 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:35,541 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:42:35,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:42:35,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:35,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:42:35,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:42:35,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:35,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:42:35,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:42:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:42:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:42:35,911 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-10-01 23:42:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:36,009 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-01 23:42:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:42:36,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-10-01 23:42:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:36,011 INFO L225 Difference]: With dead ends: 73 [2019-10-01 23:42:36,011 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 23:42:36,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:42:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 23:42:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-10-01 23:42:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 23:42:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-01 23:42:36,019 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-10-01 23:42:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:36,019 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-01 23:42:36,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:42:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-01 23:42:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:42:36,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:36,021 INFO L411 BasicCegarLoop]: trace histogram [16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:36,021 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1729755721, now seen corresponding path program 7 times [2019-10-01 23:42:36,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:36,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:36,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:42:36,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:36,126 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:36,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:42:36,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:42:36,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:36,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 26 [2019-10-01 23:42:36,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:42:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:42:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:42:36,366 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 26 states. [2019-10-01 23:42:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:36,535 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2019-10-01 23:42:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:42:36,537 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-10-01 23:42:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:36,538 INFO L225 Difference]: With dead ends: 93 [2019-10-01 23:42:36,538 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:42:36,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:42:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:42:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-10-01 23:42:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 23:42:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 23:42:36,555 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 38 [2019-10-01 23:42:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:36,555 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 23:42:36,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:42:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 23:42:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:42:36,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:36,557 INFO L411 BasicCegarLoop]: trace histogram [23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:36,560 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash -53699638, now seen corresponding path program 8 times [2019-10-01 23:42:36,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:36,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:36,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:36,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:36,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:42:36,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:36,733 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:36,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:36,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:36,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:36,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:42:36,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 23:42:37,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26] total 33 [2019-10-01 23:42:37,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:42:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:42:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:42:37,015 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 33 states. [2019-10-01 23:42:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:37,382 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2019-10-01 23:42:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:42:37,382 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-10-01 23:42:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:37,384 INFO L225 Difference]: With dead ends: 105 [2019-10-01 23:42:37,384 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 23:42:37,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:42:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 23:42:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2019-10-01 23:42:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:42:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 23:42:37,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 46 [2019-10-01 23:42:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:37,394 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 23:42:37,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:42:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 23:42:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 23:42:37,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:37,396 INFO L411 BasicCegarLoop]: trace histogram [30, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:37,396 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1314604649, now seen corresponding path program 9 times [2019-10-01 23:42:37,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:37,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:37,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:42:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:37,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:37,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:42:37,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:37,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:42:37,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:42:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:37,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:42:37,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:42:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:42:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:42:37,925 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 13 states. [2019-10-01 23:42:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:38,068 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-10-01 23:42:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:42:38,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-10-01 23:42:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:38,074 INFO L225 Difference]: With dead ends: 99 [2019-10-01 23:42:38,074 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 23:42:38,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:42:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 23:42:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-10-01 23:42:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 23:42:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-01 23:42:38,085 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2019-10-01 23:42:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:38,085 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-01 23:42:38,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:42:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-01 23:42:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 23:42:38,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:38,087 INFO L411 BasicCegarLoop]: trace histogram [30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:38,087 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash -19822330, now seen corresponding path program 10 times [2019-10-01 23:42:38,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:38,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:42:38,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:38,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:38,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:38,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:38,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:38,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:42:38,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:42:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:38,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 33] total 41 [2019-10-01 23:42:38,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:42:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:42:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:42:38,591 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 41 states. [2019-10-01 23:42:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:38,845 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-10-01 23:42:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:42:38,845 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 55 [2019-10-01 23:42:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:38,846 INFO L225 Difference]: With dead ends: 123 [2019-10-01 23:42:38,847 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 23:42:38,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:42:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 23:42:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2019-10-01 23:42:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 23:42:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 23:42:38,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 55 [2019-10-01 23:42:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:38,860 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 23:42:38,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:42:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 23:42:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 23:42:38,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:38,861 INFO L411 BasicCegarLoop]: trace histogram [38, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:38,862 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1728612361, now seen corresponding path program 11 times [2019-10-01 23:42:38,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:38,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:38,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:42:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:39,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:42:39,058 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:23,715 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-01 23:43:23,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:23,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:43:23,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:43:24,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:24,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 41] total 49 [2019-10-01 23:43:24,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:43:24,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:43:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:43:24,164 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 49 states. [2019-10-01 23:43:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:24,454 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2019-10-01 23:43:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:43:24,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 64 [2019-10-01 23:43:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:24,456 INFO L225 Difference]: With dead ends: 136 [2019-10-01 23:43:24,456 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 23:43:24,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:43:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 23:43:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2019-10-01 23:43:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:43:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-01 23:43:24,474 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 64 [2019-10-01 23:43:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:24,475 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-01 23:43:24,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:43:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-01 23:43:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:43:24,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:24,476 INFO L411 BasicCegarLoop]: trace histogram [46, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:24,477 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 429084006, now seen corresponding path program 12 times [2019-10-01 23:43:24,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:24,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:24,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 23:43:24,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:24,693 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:24,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:37,897 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:43:37,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:37,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:43:37,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:43:37,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:43:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:43:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:43:37,953 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 16 states. [2019-10-01 23:43:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:38,135 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2019-10-01 23:43:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:43:38,135 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2019-10-01 23:43:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:38,137 INFO L225 Difference]: With dead ends: 127 [2019-10-01 23:43:38,137 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 23:43:38,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:43:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 23:43:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 78. [2019-10-01 23:43:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:43:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:43:38,147 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 73 [2019-10-01 23:43:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:38,147 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:43:38,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:43:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:43:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:43:38,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:38,149 INFO L411 BasicCegarLoop]: trace histogram [46, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:38,149 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1701158487, now seen corresponding path program 13 times [2019-10-01 23:43:38,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:38,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 23:43:38,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:38,323 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:43:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:38,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:43:38,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:43:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 49] total 58 [2019-10-01 23:43:38,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 23:43:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 23:43:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:43:38,806 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 58 states. [2019-10-01 23:43:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:39,200 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2019-10-01 23:43:39,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:43:39,202 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2019-10-01 23:43:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:39,204 INFO L225 Difference]: With dead ends: 155 [2019-10-01 23:43:39,204 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 23:43:39,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:43:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 23:43:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-10-01 23:43:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:43:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-10-01 23:43:39,215 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 74 [2019-10-01 23:43:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:39,215 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-10-01 23:43:39,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 23:43:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-10-01 23:43:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 23:43:39,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:39,217 INFO L411 BasicCegarLoop]: trace histogram [55, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:39,217 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2052114922, now seen corresponding path program 14 times [2019-10-01 23:43:39,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:39,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:39,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-01 23:43:39,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:39,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:43:39,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:43:39,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:39,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:43:39,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:43:40,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:40,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 58] total 67 [2019-10-01 23:43:40,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:43:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:43:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:43:40,113 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 67 states. [2019-10-01 23:43:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:40,433 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2019-10-01 23:43:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:43:40,433 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 84 [2019-10-01 23:43:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:40,435 INFO L225 Difference]: With dead ends: 169 [2019-10-01 23:43:40,435 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 23:43:40,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:43:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 23:43:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2019-10-01 23:43:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:43:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:43:40,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 84 [2019-10-01 23:43:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:40,445 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:43:40,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:43:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:43:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-01 23:43:40,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:40,446 INFO L411 BasicCegarLoop]: trace histogram [64, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:40,446 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -210793271, now seen corresponding path program 15 times [2019-10-01 23:43:40,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:40,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:40,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:43:40,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:40,700 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:40,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:43:49,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:43:49,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:49,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:43:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:43:49,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:49,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:43:49,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:43:49,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:43:49,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:43:49,429 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 19 states. [2019-10-01 23:43:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:49,604 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2019-10-01 23:43:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:43:49,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-10-01 23:43:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:49,606 INFO L225 Difference]: With dead ends: 157 [2019-10-01 23:43:49,606 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:43:49,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:43:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:43:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2019-10-01 23:43:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 23:43:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-10-01 23:43:49,612 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 94 [2019-10-01 23:43:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:49,612 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-10-01 23:43:49,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:43:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-10-01 23:43:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:43:49,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:49,614 INFO L411 BasicCegarLoop]: trace histogram [64, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:49,614 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash -62517594, now seen corresponding path program 16 times [2019-10-01 23:43:49,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:49,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:49,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:43:49,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:49,868 INFO L224 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-10-01 23:43:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:49,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:49,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:49,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:43:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:43:50,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:50,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 67] total 77 [2019-10-01 23:43:50,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 23:43:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 23:43:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:43:50,673 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 77 states. [2019-10-01 23:43:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:51,193 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-10-01 23:43:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 23:43:51,194 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 95 [2019-10-01 23:43:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:51,196 INFO L225 Difference]: With dead ends: 189 [2019-10-01 23:43:51,196 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 23:43:51,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4285 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:43:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 23:43:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-10-01 23:43:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:43:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 23:43:51,206 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 95 [2019-10-01 23:43:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:51,206 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 23:43:51,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 23:43:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 23:43:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 23:43:51,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:51,208 INFO L411 BasicCegarLoop]: trace histogram [74, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:51,208 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash 851067369, now seen corresponding path program 17 times [2019-10-01 23:43:51,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:51,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:43:51,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:51,483 INFO L224 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-10-01 23:43:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:45:37,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-10-01 23:45:37,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:37,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:45:37,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:45:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:45:37,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:45:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:45:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:45:37,318 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 21 states. [2019-10-01 23:45:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:37,551 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-10-01 23:45:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:45:37,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-01 23:45:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:37,554 INFO L225 Difference]: With dead ends: 175 [2019-10-01 23:45:37,554 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 23:45:37,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:45:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 23:45:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 111. [2019-10-01 23:45:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 23:45:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-10-01 23:45:37,562 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 106 [2019-10-01 23:45:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:37,563 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-10-01 23:45:37,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:45:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-10-01 23:45:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 23:45:37,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:37,564 INFO L411 BasicCegarLoop]: trace histogram [74, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:37,565 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1504576122, now seen corresponding path program 18 times [2019-10-01 23:45:37,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:37,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:37,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:45:37,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:37,926 INFO L224 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-10-01 23:45:37,967 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:46:57,782 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:46:57,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:57,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:46:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:46:57,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:57,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:46:57,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:46:57,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:46:57,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:46:57,841 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 22 states. [2019-10-01 23:46:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:58,063 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2019-10-01 23:46:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:46:58,066 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-10-01 23:46:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:58,067 INFO L225 Difference]: With dead ends: 179 [2019-10-01 23:46:58,067 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:46:58,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:46:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:46:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2019-10-01 23:46:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 23:46:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-10-01 23:46:58,074 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-10-01 23:46:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:58,075 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-10-01 23:46:58,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:46:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-10-01 23:46:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 23:46:58,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:58,076 INFO L411 BasicCegarLoop]: trace histogram [74, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:58,076 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1515080311, now seen corresponding path program 19 times [2019-10-01 23:46:58,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:58,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:58,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:46:58,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:58,442 INFO L224 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-10-01 23:46:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:58,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-01 23:46:58,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 23:46:59,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:59,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 77] total 89 [2019-10-01 23:46:59,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 23:46:59,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 23:46:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3915, Invalid=3917, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 23:46:59,238 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 89 states. [2019-10-01 23:46:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:59,840 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2019-10-01 23:46:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 23:46:59,843 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 108 [2019-10-01 23:46:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:59,844 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:46:59,844 INFO L226 Difference]: Without dead ends: 185 [2019-10-01 23:46:59,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3915, Invalid=3917, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 23:46:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-01 23:46:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 125. [2019-10-01 23:46:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 23:46:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-10-01 23:46:59,853 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 108 [2019-10-01 23:46:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:59,854 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-10-01 23:46:59,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 23:46:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-10-01 23:46:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 23:46:59,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:59,855 INFO L411 BasicCegarLoop]: trace histogram [86, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:59,855 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1940650214, now seen corresponding path program 20 times [2019-10-01 23:46:59,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:59,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-10-01 23:47:00,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:00,150 INFO L224 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-10-01 23:47:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:47:00,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:47:00,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-01 23:47:00,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:47:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:00,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 89] total 101 [2019-10-01 23:47:00,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-01 23:47:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-01 23:47:00,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5049, Invalid=5051, Unknown=0, NotChecked=0, Total=10100 [2019-10-01 23:47:00,988 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 101 states. [2019-10-01 23:47:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:01,688 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2019-10-01 23:47:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-01 23:47:01,688 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 121 [2019-10-01 23:47:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:01,690 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:47:01,690 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 23:47:01,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7773 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=5049, Invalid=5051, Unknown=0, NotChecked=0, Total=10100 [2019-10-01 23:47:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 23:47:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 138. [2019-10-01 23:47:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 23:47:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-01 23:47:01,704 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 121 [2019-10-01 23:47:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:01,704 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-01 23:47:01,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-01 23:47:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-01 23:47:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 23:47:01,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:01,705 INFO L411 BasicCegarLoop]: trace histogram [98, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:01,706 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash -433845463, now seen corresponding path program 21 times [2019-10-01 23:47:01,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:01,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:01,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5082 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-01 23:47:02,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:02,161 INFO L224 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-10-01 23:47:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:47:19,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:47:19,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:19,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:47:19,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5082 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-01 23:47:19,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:19,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:47:19,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:47:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:47:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:47:19,427 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 25 states. [2019-10-01 23:47:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:19,690 INFO L93 Difference]: Finished difference Result 215 states and 240 transitions. [2019-10-01 23:47:19,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:47:19,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 134 [2019-10-01 23:47:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:19,692 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:47:19,692 INFO L226 Difference]: Without dead ends: 205 [2019-10-01 23:47:19,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:47:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-01 23:47:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 139. [2019-10-01 23:47:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 23:47:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2019-10-01 23:47:19,700 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 134 [2019-10-01 23:47:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:19,700 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2019-10-01 23:47:19,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:47:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2019-10-01 23:47:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 23:47:19,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:19,701 INFO L411 BasicCegarLoop]: trace histogram [98, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:19,701 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1612799046, now seen corresponding path program 22 times [2019-10-01 23:47:19,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:19,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:19,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:19,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-01 23:47:20,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:20,182 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:20,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:47:20,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:47:20,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:20,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-01 23:47:20,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 23:47:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:21,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 101] total 114 [2019-10-01 23:47:21,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-10-01 23:47:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-10-01 23:47:21,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6440, Invalid=6442, Unknown=0, NotChecked=0, Total=12882 [2019-10-01 23:47:21,432 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 114 states. [2019-10-01 23:47:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:22,563 INFO L93 Difference]: Finished difference Result 256 states and 296 transitions. [2019-10-01 23:47:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-01 23:47:22,564 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 135 [2019-10-01 23:47:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:22,566 INFO L225 Difference]: With dead ends: 256 [2019-10-01 23:47:22,567 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 23:47:22,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10075 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6440, Invalid=6442, Unknown=0, NotChecked=0, Total=12882 [2019-10-01 23:47:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 23:47:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 153. [2019-10-01 23:47:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 23:47:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2019-10-01 23:47:22,575 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 135 [2019-10-01 23:47:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:22,576 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2019-10-01 23:47:22,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-10-01 23:47:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2019-10-01 23:47:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-01 23:47:22,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:22,577 INFO L411 BasicCegarLoop]: trace histogram [111, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:22,577 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1401361957, now seen corresponding path program 23 times [2019-10-01 23:47:22,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:22,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6492 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2019-10-01 23:47:23,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:23,024 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:51:50,374 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-01 23:51:50,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:50,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 113 conjunts are in the unsatisfiable core [2019-10-01 23:51:50,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6492 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:51:51,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 114] total 126 [2019-10-01 23:51:51,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-10-01 23:51:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-10-01 23:51:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7874, Invalid=7876, Unknown=0, NotChecked=0, Total=15750 [2019-10-01 23:51:51,481 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 126 states. [2019-10-01 23:51:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:52,780 INFO L93 Difference]: Finished difference Result 273 states and 313 transitions. [2019-10-01 23:51:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-01 23:51:52,781 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 149 [2019-10-01 23:51:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:52,783 INFO L225 Difference]: With dead ends: 273 [2019-10-01 23:51:52,783 INFO L226 Difference]: Without dead ends: 238 [2019-10-01 23:51:52,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12489 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=7874, Invalid=7876, Unknown=0, NotChecked=0, Total=15750 [2019-10-01 23:51:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-01 23:51:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 166. [2019-10-01 23:51:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:51:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-10-01 23:51:52,793 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 149 [2019-10-01 23:51:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:52,794 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-10-01 23:51:52,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-10-01 23:51:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-10-01 23:51:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:51:52,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:52,795 INFO L411 BasicCegarLoop]: trace histogram [123, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:52,795 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1863521738, now seen corresponding path program 24 times [2019-10-01 23:51:52,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:52,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:52,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7926 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-10-01 23:51:53,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:53,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:53,304 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:54:20,040 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:54:20,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:20,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:54:20,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7926 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-10-01 23:54:20,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:54:20,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:54:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:54:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:54:20,138 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 28 states. [2019-10-01 23:54:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:20,517 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2019-10-01 23:54:20,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:54:20,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 162 [2019-10-01 23:54:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:20,520 INFO L225 Difference]: With dead ends: 252 [2019-10-01 23:54:20,520 INFO L226 Difference]: Without dead ends: 242 [2019-10-01 23:54:20,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:54:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-01 23:54:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 167. [2019-10-01 23:54:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 23:54:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2019-10-01 23:54:20,529 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 162 [2019-10-01 23:54:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:20,529 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2019-10-01 23:54:20,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:54:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2019-10-01 23:54:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:54:20,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:20,531 INFO L411 BasicCegarLoop]: trace histogram [123, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:20,531 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash -183261755, now seen corresponding path program 25 times [2019-10-01 23:54:20,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:20,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7951 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-10-01 23:54:20,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:20,973 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:21,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 125 conjunts are in the unsatisfiable core [2019-10-01 23:54:21,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7951 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:54:22,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 126] total 139 [2019-10-01 23:54:22,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-10-01 23:54:22,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-10-01 23:54:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9590, Invalid=9592, Unknown=0, NotChecked=0, Total=19182 [2019-10-01 23:54:22,353 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 139 states. [2019-10-01 23:54:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:23,530 INFO L93 Difference]: Finished difference Result 296 states and 339 transitions. [2019-10-01 23:54:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-10-01 23:54:23,531 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 163 [2019-10-01 23:54:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:23,532 INFO L225 Difference]: With dead ends: 296 [2019-10-01 23:54:23,532 INFO L226 Difference]: Without dead ends: 259 [2019-10-01 23:54:23,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15379 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=9590, Invalid=9592, Unknown=0, NotChecked=0, Total=19182 [2019-10-01 23:54:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-01 23:54:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2019-10-01 23:54:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 23:54:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2019-10-01 23:54:23,541 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 163 [2019-10-01 23:54:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:23,542 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2019-10-01 23:54:23,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-10-01 23:54:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2019-10-01 23:54:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 23:54:23,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:23,544 INFO L411 BasicCegarLoop]: trace histogram [136, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:23,544 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 147036806, now seen corresponding path program 26 times [2019-10-01 23:54:23,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 9316 trivial. 0 not checked. [2019-10-01 23:54:24,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:24,186 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:54:24,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:54:24,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:24,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 138 conjunts are in the unsatisfiable core [2019-10-01 23:54:24,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:54:25,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:25,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 139] total 151 [2019-10-01 23:54:25,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-10-01 23:54:25,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-10-01 23:54:25,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11324, Invalid=11326, Unknown=0, NotChecked=0, Total=22650 [2019-10-01 23:54:25,853 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 151 states. [2019-10-01 23:54:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:27,219 INFO L93 Difference]: Finished difference Result 313 states and 356 transitions. [2019-10-01 23:54:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-10-01 23:54:27,220 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 177 [2019-10-01 23:54:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:27,221 INFO L225 Difference]: With dead ends: 313 [2019-10-01 23:54:27,221 INFO L226 Difference]: Without dead ends: 275 [2019-10-01 23:54:27,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18309 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=11324, Invalid=11326, Unknown=0, NotChecked=0, Total=22650 [2019-10-01 23:54:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-01 23:54:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2019-10-01 23:54:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-01 23:54:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2019-10-01 23:54:27,232 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 177 [2019-10-01 23:54:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:27,232 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2019-10-01 23:54:27,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-10-01 23:54:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2019-10-01 23:54:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 23:54:27,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:27,234 INFO L411 BasicCegarLoop]: trace histogram [148, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:27,234 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1275960713, now seen corresponding path program 27 times [2019-10-01 23:54:27,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:27,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:27,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11404 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 11026 trivial. 0 not checked. [2019-10-01 23:54:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:27,801 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:39,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:55:39,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:39,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:55:39,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11404 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 11026 trivial. 0 not checked. [2019-10-01 23:55:39,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:39,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:55:39,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:55:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:55:39,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:55:39,200 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 31 states. [2019-10-01 23:55:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:39,577 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2019-10-01 23:55:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:55:39,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 190 [2019-10-01 23:55:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:39,580 INFO L225 Difference]: With dead ends: 289 [2019-10-01 23:55:39,580 INFO L226 Difference]: Without dead ends: 279 [2019-10-01 23:55:39,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:55:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-01 23:55:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-10-01 23:55:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 23:55:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2019-10-01 23:55:39,591 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 190 [2019-10-01 23:55:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:39,592 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2019-10-01 23:55:39,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:55:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2019-10-01 23:55:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-01 23:55:39,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:39,594 INFO L411 BasicCegarLoop]: trace histogram [148, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:39,594 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1217784346, now seen corresponding path program 28 times [2019-10-01 23:55:39,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:39,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:39,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11432 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 11026 trivial. 0 not checked. [2019-10-01 23:55:40,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:40,389 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:40,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:40,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:40,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:40,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 150 conjunts are in the unsatisfiable core [2019-10-01 23:55:40,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11432 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-01 23:55:42,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:42,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 151] total 164 [2019-10-01 23:55:42,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-10-01 23:55:42,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-10-01 23:55:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13365, Invalid=13367, Unknown=0, NotChecked=0, Total=26732 [2019-10-01 23:55:42,054 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 164 states. [2019-10-01 23:55:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:43,416 INFO L93 Difference]: Finished difference Result 336 states and 382 transitions. [2019-10-01 23:55:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-10-01 23:55:43,417 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 191 [2019-10-01 23:55:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:43,419 INFO L225 Difference]: With dead ends: 336 [2019-10-01 23:55:43,419 INFO L226 Difference]: Without dead ends: 296 [2019-10-01 23:55:43,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21787 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=13365, Invalid=13367, Unknown=0, NotChecked=0, Total=26732 [2019-10-01 23:55:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-01 23:55:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 209. [2019-10-01 23:55:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 23:55:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2019-10-01 23:55:43,431 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 191 [2019-10-01 23:55:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:43,431 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2019-10-01 23:55:43,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-10-01 23:55:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2019-10-01 23:55:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-01 23:55:43,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:43,433 INFO L411 BasicCegarLoop]: trace histogram [161, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:43,434 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1923599493, now seen corresponding path program 29 times [2019-10-01 23:55:43,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13476 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2019-10-01 23:55:44,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:44,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:44,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1