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-fea9116 [2019-09-20 12:57:26,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:57:26,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:57:26,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:57:26,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:57:26,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:57:26,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:57:26,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:57:26,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:57:26,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:57:26,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:57:26,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:57:26,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:57:26,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:57:26,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:57:26,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:57:26,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:57:26,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:57:26,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:57:26,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:57:26,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:57:26,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:57:26,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:57:26,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:57:26,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:57:26,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:57:26,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:57:26,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:57:26,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:57:26,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:57:26,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:57:26,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:57:26,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:57:26,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:57:26,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:57:26,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:57:26,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:57:26,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:57:26,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:57:26,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:57:26,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:57:26,957 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-20 12:57:26,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:57:26,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:57:26,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:57:26,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:57:26,984 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:57:26,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:57:26,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:57:26,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:57:26,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:57:26,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:57:26,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:57:26,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:57:26,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:57:26,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:57:26,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:57:26,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:57:26,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:57:26,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:57:26,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:57:26,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:57:26,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:57:26,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:57:26,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:57:26,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:57:26,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:57:26,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:57:26,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:57:26,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:57:26,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:57:27,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:57:27,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:57:27,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:57:27,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:57:27,045 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:57:27,046 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-20 12:57:27,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6199d0372/5ca551c46448415ba6d2bb64c5a43f7f/FLAGc3e984b0d [2019-09-20 12:57:27,589 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:57:27,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-09-20 12:57:27,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6199d0372/5ca551c46448415ba6d2bb64c5a43f7f/FLAGc3e984b0d [2019-09-20 12:57:27,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6199d0372/5ca551c46448415ba6d2bb64c5a43f7f [2019-09-20 12:57:27,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:57:27,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:57:27,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:27,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:57:27,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:57:27,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:27,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e40b13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:27, skipping insertion in model container [2019-09-20 12:57:27,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:28,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:57:28,021 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:57:28,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,206 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:57:28,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,239 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:57:28,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28 WrapperNode [2019-09-20 12:57:28,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:28,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:57:28,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:57:28,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:57:28,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:57:28,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:57:28,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (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-20 12:57:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:57:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:57:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:57:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-20 12:57:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:57:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:57:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 12:57:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:57:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:57:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:57:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:57:28,719 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:57:28,720 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:57:28,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28 BoogieIcfgContainer [2019-09-20 12:57:28,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:57:28,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:57:28,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:57:28,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:57:28,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:57:27" (1/3) ... [2019-09-20 12:57:28,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31df488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (2/3) ... [2019-09-20 12:57:28,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31df488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28" (3/3) ... [2019-09-20 12:57:28,730 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-09-20 12:57:28,753 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:57:28,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:57:28,775 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:57:28,806 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:57:28,807 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:57:28,807 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:57:28,807 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:57:28,807 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:57:28,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:57:28,808 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:57:28,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:57:28,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:57:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-20 12:57:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 12:57:28,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:28,834 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:28,836 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-09-20 12:57:28,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:28,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:28,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:28,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,038 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-20 12:57:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:57:29,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:57:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:57:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:29,057 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-20 12:57:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,078 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-20 12:57:29,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:57:29,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-20 12:57:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,088 INFO L225 Difference]: With dead ends: 45 [2019-09-20 12:57:29,088 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 12:57:29,091 INFO L636 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-20 12:57:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 12:57:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-20 12:57:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 12:57:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-20 12:57:29,128 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-09-20 12:57:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,129 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-20 12:57:29,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:57:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-20 12:57:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:57:29,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,131 INFO L407 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-20 12:57:29,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-09-20 12:57:29,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,288 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-20 12:57:29,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:57:29,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:57:29,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:57:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:57:29,292 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-09-20 12:57:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,353 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-20 12:57:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:57:29,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-20 12:57:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,355 INFO L225 Difference]: With dead ends: 30 [2019-09-20 12:57:29,355 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 12:57:29,356 INFO L636 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-20 12:57:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 12:57:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-20 12:57:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 12:57:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-20 12:57:29,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-09-20 12:57:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,362 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-20 12:57:29,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:57:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-20 12:57:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:57:29,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,364 INFO L407 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-20 12:57:29,364 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-09-20 12:57:29,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,610 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-20 12:57:29,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:57:29,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:57:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:57:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:57:29,612 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-20 12:57:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,688 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-20 12:57:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:57:29,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-20 12:57:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,690 INFO L225 Difference]: With dead ends: 34 [2019-09-20 12:57:29,690 INFO L226 Difference]: Without dead ends: 25 [2019-09-20 12:57:29,691 INFO L636 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-20 12:57:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-20 12:57:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-20 12:57:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 12:57:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-20 12:57:29,698 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-20 12:57:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,699 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-20 12:57:29,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:57:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-20 12:57:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:57:29,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,700 INFO L407 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-20 12:57:29,701 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-09-20 12:57:29,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,888 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-20 12:57:29,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:57:29,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:57:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:57:29,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:57:29,890 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-20 12:57:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,992 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-20 12:57:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:57:29,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-20 12:57:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,997 INFO L225 Difference]: With dead ends: 46 [2019-09-20 12:57:29,998 INFO L226 Difference]: Without dead ends: 32 [2019-09-20 12:57:29,998 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:57:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-20 12:57:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-09-20 12:57:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 12:57:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-20 12:57:30,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-09-20 12:57:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:30,007 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-20 12:57:30,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:57:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-20 12:57:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:57:30,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:30,009 INFO L407 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-20 12:57:30,009 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:30,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2090216834, now seen corresponding path program 1 times [2019-09-20 12:57:30,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:30,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,099 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-20 12:57:30,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:57:30,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:57:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:57:30,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:30,102 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-09-20 12:57:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:30,157 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-20 12:57:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:57:30,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-20 12:57:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:30,161 INFO L225 Difference]: With dead ends: 48 [2019-09-20 12:57:30,161 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 12:57:30,162 INFO L636 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-20 12:57:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 12:57:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-09-20 12:57:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:57:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-20 12:57:30,194 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-09-20 12:57:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:30,194 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-20 12:57:30,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:57:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-20 12:57:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:57:30,197 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:30,198 INFO L407 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-20 12:57:30,199 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-09-20 12:57:30,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,375 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-20 12:57:30,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:30,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:30,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:57:30,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:30,703 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-20 12:57:30,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:30,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-20 12:57:30,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:57:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:57:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:57:30,710 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-09-20 12:57:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:31,213 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-20 12:57:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 12:57:31,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-20 12:57:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:31,214 INFO L225 Difference]: With dead ends: 46 [2019-09-20 12:57:31,215 INFO L226 Difference]: Without dead ends: 32 [2019-09-20 12:57:31,215 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:57:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-20 12:57:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-20 12:57:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-20 12:57:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-20 12:57:31,229 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2019-09-20 12:57:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:31,229 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-20 12:57:31,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:57:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-20 12:57:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:57:31,230 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:31,230 INFO L407 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-20 12:57:31,230 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-09-20 12:57:31,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:31,336 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-20 12:57:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:31,337 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:31,360 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-20 12:57:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:31,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:57:31,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:31,421 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-20 12:57:31,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:31,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 12:57:31,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:57:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:57:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:57:31,427 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2019-09-20 12:57:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:31,483 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-20 12:57:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:57:31,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-20 12:57:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:31,486 INFO L225 Difference]: With dead ends: 52 [2019-09-20 12:57:31,486 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 12:57:31,486 INFO L636 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-20 12:57:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 12:57:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-20 12:57:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 12:57:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-20 12:57:31,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-09-20 12:57:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:31,498 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-20 12:57:31,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:57:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-20 12:57:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:57:31,503 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:31,503 INFO L407 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-20 12:57:31,503 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 1 times [2019-09-20 12:57:31,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:31,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:33,923 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 163 DAG size of output: 31 [2019-09-20 12:57:36,343 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-20 12:57:36,350 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-20 12:57:36,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:36,351 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:36,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-20 12:57:36,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:36,490 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 45 treesize of output 41 [2019-09-20 12:57:36,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:36,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:36,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1 [2019-09-20 12:57:36,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:36,550 INFO L567 ElimStorePlain]: treesize reduction 219, result has 10.6 percent of original size [2019-09-20 12:57:36,551 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-09-20 12:57:36,551 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-20 12:57:36,551 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-20 12:57:36,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:36,552 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-09-20 12:57:36,884 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-20 12:57:37,207 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-20 12:57:37,400 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-20 12:57:37,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:37,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-20 12:57:37,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 12:57:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 12:57:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:57:37,410 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2019-09-20 12:57:37,745 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-20 12:57:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:37,932 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-20 12:57:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:57:37,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-20 12:57:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:37,940 INFO L225 Difference]: With dead ends: 46 [2019-09-20 12:57:37,940 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 12:57:37,941 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:57:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 12:57:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-20 12:57:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 12:57:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-20 12:57:37,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 28 [2019-09-20 12:57:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:37,947 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-20 12:57:37,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 12:57:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-20 12:57:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:57:37,948 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:37,948 INFO L407 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-20 12:57:37,948 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-09-20 12:57:37,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:37,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:37,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:37,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,016 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-20 12:57:38,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:38,017 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:38,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:38,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:38,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:57:38,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:38,111 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-20 12:57:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-20 12:57:38,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:57:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:57:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:57:38,121 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 7 states. [2019-09-20 12:57:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,226 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-20 12:57:38,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:57:38,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-20 12:57:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,228 INFO L225 Difference]: With dead ends: 56 [2019-09-20 12:57:38,228 INFO L226 Difference]: Without dead ends: 44 [2019-09-20 12:57:38,230 INFO L636 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-20 12:57:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-20 12:57:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2019-09-20 12:57:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 12:57:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-20 12:57:38,236 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-09-20 12:57:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,236 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-20 12:57:38,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:57:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-20 12:57:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:57:38,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,237 INFO L407 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-20 12:57:38,238 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,238 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 2 times [2019-09-20 12:57:38,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:38,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,314 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 35 [2019-09-20 12:57:39,756 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-20 12:57:40,141 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-20 12:57:40,734 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-09-20 12:57:41,032 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71