java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:29:42,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:29:42,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:29:42,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:29:42,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:29:42,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:29:42,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:29:42,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:29:42,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:29:42,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:29:42,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:29:42,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:29:42,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:29:42,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:29:42,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:29:42,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:29:42,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:29:42,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:29:42,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:29:42,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:29:42,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:29:42,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:29:42,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:29:42,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:29:42,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:29:42,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:29:42,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:29:42,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:29:42,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:29:42,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:29:42,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:29:42,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:29:42,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:29:42,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:29:42,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:29:42,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:29:42,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:29:42,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:29:42,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:29:42,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:29:42,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:29:42,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:29:42,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:29:42,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:29:42,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:29:42,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:29:42,766 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:29:42,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:29:42,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:29:42,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:29:42,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:29:42,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:29:42,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:29:42,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:29:42,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:29:42,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:29:42,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:29:42,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:29:42,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:29:42,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:29:42,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:29:42,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:29:42,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:29:42,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:29:42,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:29:42,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:29:42,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:29:42,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:29:42,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:29:42,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:29:42,830 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:29:42,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-09-08 02:29:42,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61aa865/31e4bae1fbf94214b34c7a8b8b74fd23/FLAGf86b1ca37 [2019-09-08 02:29:43,389 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:29:43,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-09-08 02:29:43,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61aa865/31e4bae1fbf94214b34c7a8b8b74fd23/FLAGf86b1ca37 [2019-09-08 02:29:43,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61aa865/31e4bae1fbf94214b34c7a8b8b74fd23 [2019-09-08 02:29:43,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:29:43,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:29:43,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:29:43,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:29:43,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:29:43,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:29:43" (1/1) ... [2019-09-08 02:29:43,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbd674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:43, skipping insertion in model container [2019-09-08 02:29:43,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:29:43" (1/1) ... [2019-09-08 02:29:43,755 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:29:43,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:29:43,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:29:43,997 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:29:44,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:29:44,113 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:29:44,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44 WrapperNode [2019-09-08 02:29:44,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:29:44,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:29:44,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:29:44,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:29:44,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... [2019-09-08 02:29:44,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:29:44,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:29:44,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:29:44,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:29:44,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:29:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:29:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:29:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:29:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-08 02:29:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:29:44,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:29:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:29:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:29:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:29:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:29:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:29:44,499 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:29:44,499 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:29:44,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:29:44 BoogieIcfgContainer [2019-09-08 02:29:44,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:29:44,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:29:44,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:29:44,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:29:44,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:29:43" (1/3) ... [2019-09-08 02:29:44,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f42cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:29:44, skipping insertion in model container [2019-09-08 02:29:44,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:44" (2/3) ... [2019-09-08 02:29:44,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f42cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:29:44, skipping insertion in model container [2019-09-08 02:29:44,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:29:44" (3/3) ... [2019-09-08 02:29:44,517 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-09-08 02:29:44,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:29:44,537 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:29:44,572 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:29:44,602 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:29:44,603 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:29:44,603 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:29:44,604 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:29:44,604 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:29:44,604 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:29:44,604 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:29:44,604 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:29:44,604 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:29:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-08 02:29:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:29:44,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:44,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:44,629 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-09-08 02:29:44,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:44,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:44,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:44,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:44,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:29:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:29:44,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:29:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:29:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:29:44,836 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-08 02:29:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:44,866 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-08 02:29:44,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:29:44,867 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-08 02:29:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:44,880 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:29:44,880 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:29:44,888 INFO L628 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-09-08 02:29:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:29:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 02:29:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:29:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-08 02:29:44,949 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-09-08 02:29:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:44,950 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-08 02:29:44,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:29:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-08 02:29:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:29:44,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:44,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:44,955 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-09-08 02:29:44,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:45,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:29:45,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:29:45,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:29:45,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:29:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:29:45,170 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-09-08 02:29:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:45,213 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-08 02:29:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:29:45,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-08 02:29:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:45,215 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:29:45,215 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:29:45,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:29:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:29:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 02:29:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:29:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-08 02:29:45,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-09-08 02:29:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:45,223 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-08 02:29:45,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:29:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-08 02:29:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:29:45,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:45,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:45,225 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-09-08 02:29:45,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:29:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:29:45,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:29:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:29:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:29:45,421 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-08 02:29:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:45,515 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-08 02:29:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:29:45,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 02:29:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:45,516 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:29:45,517 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:29:45,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:29:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:29:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-08 02:29:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:29:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-08 02:29:45,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-08 02:29:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:45,524 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-08 02:29:45,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:29:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-08 02:29:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:29:45,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:45,526 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:45,526 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-09-08 02:29:45,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:45,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:29:45,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:29:45,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:29:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:29:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:29:45,664 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2019-09-08 02:29:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:45,722 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-08 02:29:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:29:45,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-08 02:29:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:45,729 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:29:45,729 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:29:45,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:29:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:29:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-08 02:29:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:29:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-08 02:29:45,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-09-08 02:29:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:45,747 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-08 02:29:45,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:29:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-08 02:29:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:29:45,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:45,749 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:45,750 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-09-08 02:29:45,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:29:46,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:46,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:29:46,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:46,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:29:46,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:29:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-08 02:29:46,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:29:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:29:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:29:46,337 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-08 02:29:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:46,722 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-08 02:29:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:29:46,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-08 02:29:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:46,723 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:29:46,723 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:29:46,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:29:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:29:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 02:29:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:29:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-08 02:29:46,730 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-08 02:29:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:46,731 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-08 02:29:46,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:29:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-08 02:29:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:29:46,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:46,732 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:46,733 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1832051396, now seen corresponding path program 1 times [2019-09-08 02:29:46,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:46,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:46,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:46,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:29:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:46,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:29:46,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:46,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:46,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-08 02:29:46,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:29:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:29:46,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:29:46,983 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 8 states. [2019-09-08 02:29:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:47,081 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-08 02:29:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:29:47,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-08 02:29:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:47,085 INFO L225 Difference]: With dead ends: 40 [2019-09-08 02:29:47,085 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:29:47,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:29:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:29:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-08 02:29:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:29:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-08 02:29:47,101 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2019-09-08 02:29:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:47,103 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-08 02:29:47,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:29:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-08 02:29:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:29:47,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:47,111 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:47,111 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-09-08 02:29:47,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:47,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:47,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:47,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:29:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:47,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:29:47,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:47,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:47,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:29:47,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:29:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:29:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:29:47,286 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-09-08 02:29:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:47,364 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-09-08 02:29:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:29:47,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-08 02:29:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:47,365 INFO L225 Difference]: With dead ends: 52 [2019-09-08 02:29:47,366 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:29:47,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:29:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:29:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-08 02:29:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:29:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-08 02:29:47,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2019-09-08 02:29:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:47,373 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-08 02:29:47,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:29:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-08 02:29:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:29:47,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:47,374 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:47,375 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 2 times [2019-09-08 02:29:47,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:47,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:47,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:47,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:47,877 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2019-09-08 02:29:48,149 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-08 02:29:48,723 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2019-09-08 02:29:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:48,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:48,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:48,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:29:48,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:29:48,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:48,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:29:48,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:55,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-09-08 02:29:55,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:55,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-09-08 02:29:55,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:01,302 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-09-08 02:30:01,303 INFO L567 ElimStorePlain]: treesize reduction 309, result has 8.8 percent of original size [2019-09-08 02:30:01,304 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-08 02:30:01,304 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-08 02:30:01,304 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-09-08 02:30:01,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:30:01,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:347, output treesize:30 [2019-09-08 02:30:01,850 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 02:30:02,922 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 02:30:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:03,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-08 02:30:03,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:30:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:30:03,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=359, Unknown=2, NotChecked=0, Total=420 [2019-09-08 02:30:03,201 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 21 states. [2019-09-08 02:30:03,561 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-08 02:30:04,080 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 02:30:05,347 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 02:30:07,241 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 02:30:08,492 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 02:30:10,635 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-08 02:30:11,110 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-09-08 02:30:11,858 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-08 02:30:12,117 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-08 02:30:12,979 WARN L188 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 02:30:13,295 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-08 02:30:13,596 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 02:30:13,936 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 02:30:14,700 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-08 02:30:15,103 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2019-09-08 02:30:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:15,356 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-08 02:30:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:30:15,357 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-09-08 02:30:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:15,358 INFO L225 Difference]: With dead ends: 74 [2019-09-08 02:30:15,358 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 02:30:15,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=309, Invalid=1495, Unknown=2, NotChecked=0, Total=1806 [2019-09-08 02:30:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 02:30:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-09-08 02:30:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:30:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 02:30:15,371 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-08 02:30:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:15,372 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 02:30:15,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:30:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 02:30:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:30:15,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:15,375 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:15,375 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-09-08 02:30:15,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:15,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:15,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:15,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:15,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:15,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:30:15,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:15,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:30:15,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:15,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:30:15,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:15,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:15,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:30:15,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:30:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:30:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:30:15,540 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-08 02:30:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:15,635 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-08 02:30:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:30:15,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-08 02:30:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:15,638 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:30:15,638 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:30:15,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:30:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:30:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-09-08 02:30:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:30:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-08 02:30:15,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-08 02:30:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:15,646 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-08 02:30:15,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:30:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-08 02:30:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:30:15,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:15,647 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:15,647 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 3 times [2019-09-08 02:30:15,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:15,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:15,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:15,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:15,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:18,166 WARN L188 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 225 DAG size of output: 37 [2019-09-08 02:30:18,625 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-08 02:30:18,887 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-08 02:30:19,518 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 40 [2019-09-08 02:30:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:19,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:19,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:19,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:30:19,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:30:19,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:19,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:30:19,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:19,617 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:19,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:19,664 INFO L567 ElimStorePlain]: treesize reduction 195, result has 12.2 percent of original size [2019-09-08 02:30:19,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-08 02:30:19,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:19,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:19,673 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-08 02:30:19,673 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-08 02:30:19,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:19,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-08 02:30:19,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:19,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:21,471 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-08 02:30:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-09-08 02:30:22,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:30:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:30:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=491, Unknown=2, NotChecked=0, Total=552 [2019-09-08 02:30:22,818 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2019-09-08 02:30:24,650 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 02:30:24,914 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-09-08 02:30:25,287 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-08 02:30:25,471 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 02:30:25,716 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 02:30:25,990 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-08 02:30:26,216 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-08 02:30:26,454 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-08 02:30:26,702 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2019-09-08 02:30:27,021 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-08 02:30:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:27,736 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-08 02:30:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:30:27,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-08 02:30:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:27,740 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:30:27,740 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 02:30:27,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=219, Invalid=1419, Unknown=2, NotChecked=0, Total=1640 [2019-09-08 02:30:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 02:30:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-08 02:30:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:30:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-08 02:30:27,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 32 [2019-09-08 02:30:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:27,758 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-08 02:30:27,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:30:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-08 02:30:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:30:27,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:27,761 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:27,761 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1595152954, now seen corresponding path program 3 times [2019-09-08 02:30:27,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:27,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:27,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:27,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:30:27,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:28,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 02:30:28,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:28,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:30:28,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:30:28,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:30:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:30:28,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:30:28,046 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-09-08 02:30:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:28,157 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-09-08 02:30:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:30:28,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-08 02:30:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:28,160 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:30:28,160 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:30:28,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:30:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:30:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-08 02:30:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:30:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-08 02:30:28,167 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2019-09-08 02:30:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:28,168 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-08 02:30:28,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:30:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-08 02:30:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:30:28,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:28,169 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:28,169 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1336987516, now seen corresponding path program 4 times [2019-09-08 02:30:28,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:28,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:28,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:28,607 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 31 [2019-09-08 02:30:28,982 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-08 02:30:29,181 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 02:30:29,478 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 02:30:33,710 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 02:30:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:36,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:36,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:30:36,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:30:36,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:36,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:30:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:36,315 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:36,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:36,359 INFO L567 ElimStorePlain]: treesize reduction 197, result has 12.1 percent of original size [2019-09-08 02:30:36,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-08 02:30:36,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:36,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:36,374 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-08 02:30:36,374 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-08 02:30:36,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:36,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-08 02:30:43,035 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 02:30:43,346 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 02:30:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:43,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:43,608 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 02:30:43,921 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 02:30:44,655 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 02:30:44,920 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-08 02:30:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-09-08 02:30:45,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:30:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:30:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=827, Unknown=4, NotChecked=0, Total=930 [2019-09-08 02:30:45,124 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 31 states. [2019-09-08 02:30:55,605 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_linear_search_#in~a.base| c_linear_search_~a.base)) (.cse8 (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset))) (and (<= c_~MAX~0 100000) (or (not |c_linear_search_#t~short1|) (let ((.cse0 (= c_linear_search_~a.offset 0))) (and (or (not .cse0) (let ((.cse1 (div c_linear_search_~n 4294967296))) (let ((.cse2 (div c_linear_search_~j~0 4294967296)) (.cse3 (* 4294967296 .cse1))) (and (or (<= .cse1 .cse2) (<= (+ .cse3 4) (+ (* 4294967296 .cse2) c_linear_search_~n))) (or (< .cse2 .cse1) (and (<= .cse2 0) (or (<= (+ .cse1 1) .cse2) (let ((.cse7 (* 2 c_linear_search_~j~0))) (let ((.cse5 (div (+ .cse7 (* (- 4294967296) .cse2) .cse3 (* (- 1) c_linear_search_~n) (- 1)) 2))) (let ((.cse6 (+ (* 4 .cse5) 6))) (and (or (and .cse4 (not (= |c_linear_search_#in~q| (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* 4 c_linear_search_~j~0) (* (- 4) .cse5) c_linear_search_~a.offset (- 4)))))) (< .cse6 .cse7)) (<= .cse6 .cse7)))))))))))) (<= 3 c_linear_search_~j~0) (or .cse8 .cse0)))) .cse4 .cse8 (< 0 (+ (div c_~MAX~0 4294967296) 1)) (= |c_linear_search_#in~n| c_linear_search_~n) (exists ((v_main_~a~0.offset_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int)) (= 3 (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (+ (* 4 (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296)) v_main_~a~0.offset_BEFORE_CALL_3)))) (= |c_linear_search_#in~q| c_linear_search_~q) (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~j~0 0))) is different from true [2019-09-08 02:30:56,615 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-09-08 02:30:56,862 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-09-08 02:30:57,045 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-08 02:30:59,642 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-09-08 02:31:02,031 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2019-09-08 02:31:02,242 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2019-09-08 02:31:04,440 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2019-09-08 02:31:04,853 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-08 02:31:05,008 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-08 02:31:05,223 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2019-09-08 02:31:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:31:07,993 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2019-09-08 02:31:07,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:31:07,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-09-08 02:31:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:31:07,997 INFO L225 Difference]: With dead ends: 91 [2019-09-08 02:31:07,998 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 02:31:08,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=349, Invalid=2841, Unknown=6, NotChecked=110, Total=3306 [2019-09-08 02:31:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 02:31:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2019-09-08 02:31:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:31:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-08 02:31:08,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 36 [2019-09-08 02:31:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:31:08,007 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-08 02:31:08,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:31:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-08 02:31:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:31:08,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:31:08,008 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:31:08,009 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:31:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:31:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1972633310, now seen corresponding path program 4 times [2019-09-08 02:31:08,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:31:08,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:31:08,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:08,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:31:08,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:31:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:31:08,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:31:08,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:31:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:31:08,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:31:08,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:31:08,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:31:08,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:31:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:31:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:31:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:31:08,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:31:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:31:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:31:08,186 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2019-09-08 02:31:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:31:08,301 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-08 02:31:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:31:08,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-08 02:31:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:31:08,303 INFO L225 Difference]: With dead ends: 64 [2019-09-08 02:31:08,303 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:31:08,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:31:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:31:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-09-08 02:31:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:31:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-08 02:31:08,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-08 02:31:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:31:08,322 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-08 02:31:08,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:31:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-08 02:31:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:31:08,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:31:08,323 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:31:08,324 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:31:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:31:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2064168548, now seen corresponding path program 5 times [2019-09-08 02:31:08,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:31:08,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:31:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:08,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:31:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:31:08,564 ERROR L253 erpolLogProxyWrapper]: Interpolant 29 not inductive: (Check returned sat) [2019-09-08 02:31:08,600 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 02:31:08,610 INFO L168 Benchmark]: Toolchain (without parser) took 84868.39 ms. Allocated memory was 132.6 MB in the beginning and 399.0 MB in the end (delta: 266.3 MB). Free memory was 89.3 MB in the beginning and 108.1 MB in the end (delta: -18.7 MB). Peak memory consumption was 247.6 MB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,611 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.09 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 177.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,617 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 174.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,618 INFO L168 Benchmark]: RCFGBuilder took 347.19 ms. Allocated memory is still 199.8 MB. Free memory was 174.8 MB in the beginning and 159.1 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,622 INFO L168 Benchmark]: TraceAbstraction took 84102.83 ms. Allocated memory was 199.8 MB in the beginning and 399.0 MB in the end (delta: 199.2 MB). Free memory was 159.1 MB in the beginning and 108.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:31:08,629 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 375.09 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 177.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 174.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.19 ms. Allocated memory is still 199.8 MB. Free memory was 174.8 MB in the beginning and 159.1 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84102.83 ms. Allocated memory was 199.8 MB in the beginning and 399.0 MB in the end (delta: 199.2 MB). Free memory was 159.1 MB in the beginning and 108.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...