java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:34:21,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:34:21,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:34:21,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:34:21,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:34:21,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:34:21,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:34:21,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:34:21,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:34:21,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:34:21,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:34:21,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:34:21,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:34:21,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:34:21,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:34:21,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:34:21,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:34:21,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:34:21,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:34:21,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:34:21,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:34:21,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:34:21,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:34:21,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:34:21,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:34:21,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:34:21,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:34:21,885 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:34:21,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:34:21,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:34:21,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:34:21,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:34:21,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:34:21,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:34:21,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:34:21,897 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:34:21,897 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:34:21,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:34:21,897 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:34:21,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:34:21,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:34:21,899 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:34:21,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:34:21,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:34:21,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:34:21,899 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:34:21,900 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:34:21,900 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:34:21,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:34:21,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:34:21,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:34:21,901 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:34:21,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:34:21,901 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:34:21,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:34:21,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:34:21,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:34:21,902 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:34:21,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:34:21,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:34:21,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:34:21,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:34:21,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:34:21,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:34:21,904 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:34:21,904 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:34:21,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:34:21,951 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:34:21,955 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:34:21,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:34:21,957 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:34:21,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-01-28 21:34:22,133 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:34:22,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:34:22,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:34:22,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:34:22,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:34:22,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1142a270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22, skipping insertion in model container [2018-01-28 21:34:22,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,164 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:34:22,202 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:34:22,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:34:22,324 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:34:22,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22 WrapperNode [2018-01-28 21:34:22,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:34:22,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:34:22,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:34:22,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:34:22,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... [2018-01-28 21:34:22,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:34:22,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:34:22,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:34:22,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:34:22,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (1/1) ... No working directory specified, using /storage/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 [2018-01-28 21:34:22,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:34:22,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:34:22,411 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-28 21:34:22,411 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:34:22,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:34:22,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:34:22,614 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:34:22,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:34:22 BoogieIcfgContainer [2018-01-28 21:34:22,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:34:22,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:34:22,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:34:22,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:34:22,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:34:22" (1/3) ... [2018-01-28 21:34:22,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27571a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:34:22, skipping insertion in model container [2018-01-28 21:34:22,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:22" (2/3) ... [2018-01-28 21:34:22,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27571a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:34:22, skipping insertion in model container [2018-01-28 21:34:22,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:34:22" (3/3) ... [2018-01-28 21:34:22,622 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-01-28 21:34:22,629 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:34:22,634 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-28 21:34:22,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:34:22,671 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:34:22,671 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:34:22,671 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:34:22,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:34:22,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:34:22,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:34:22,672 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:34:22,673 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:34:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-28 21:34:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 21:34:22,699 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:22,700 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:22,700 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 608637057, now seen corresponding path program 1 times [2018-01-28 21:34:22,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:22,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:22,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:22,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:22,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:22,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:22,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:34:22,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:34:22,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:34:22,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:34:22,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:34:22,973 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2018-01-28 21:34:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:23,222 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-28 21:34:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:34:23,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-28 21:34:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:23,238 INFO L225 Difference]: With dead ends: 99 [2018-01-28 21:34:23,238 INFO L226 Difference]: Without dead ends: 60 [2018-01-28 21:34:23,242 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:34:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-28 21:34:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-28 21:34:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-28 21:34:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-28 21:34:23,281 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 17 [2018-01-28 21:34:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:23,281 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-28 21:34:23,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:34:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-28 21:34:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 21:34:23,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:23,282 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:23,282 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 608637058, now seen corresponding path program 1 times [2018-01-28 21:34:23,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:23,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:23,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:23,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:23,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:23,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:34:23,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:34:23,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:34:23,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:34:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:34:23,405 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-01-28 21:34:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:23,594 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-28 21:34:23,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:34:23,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-28 21:34:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:23,596 INFO L225 Difference]: With dead ends: 60 [2018-01-28 21:34:23,596 INFO L226 Difference]: Without dead ends: 59 [2018-01-28 21:34:23,597 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:34:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-28 21:34:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-28 21:34:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-28 21:34:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-28 21:34:23,604 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 17 [2018-01-28 21:34:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:23,605 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-28 21:34:23,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:34:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-28 21:34:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 21:34:23,606 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:23,606 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:23,606 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash 186914476, now seen corresponding path program 1 times [2018-01-28 21:34:23,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:23,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:23,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:23,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:23,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:23,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:34:23,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:34:23,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:34:23,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:34:23,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:34:23,671 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-01-28 21:34:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:23,731 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-28 21:34:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:34:23,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-28 21:34:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:23,733 INFO L225 Difference]: With dead ends: 59 [2018-01-28 21:34:23,733 INFO L226 Difference]: Without dead ends: 56 [2018-01-28 21:34:23,733 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:34:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-28 21:34:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-28 21:34:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-28 21:34:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-28 21:34:23,739 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 24 [2018-01-28 21:34:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:23,739 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-28 21:34:23,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:34:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-28 21:34:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 21:34:23,740 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:23,740 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:23,740 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:23,740 INFO L82 PathProgramCache]: Analyzing trace with hash 186914477, now seen corresponding path program 1 times [2018-01-28 21:34:23,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:23,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:23,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:23,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:23,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:23,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:34:23,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:34:23,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:34:23,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:34:23,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:34:23,931 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-01-28 21:34:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:24,033 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-01-28 21:34:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:34:24,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-28 21:34:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:24,035 INFO L225 Difference]: With dead ends: 94 [2018-01-28 21:34:24,035 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 21:34:24,035 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:34:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 21:34:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-28 21:34:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-28 21:34:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-28 21:34:24,040 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 24 [2018-01-28 21:34:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:24,041 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-28 21:34:24,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:34:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-28 21:34:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 21:34:24,041 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:24,042 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:24,042 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1679529059, now seen corresponding path program 1 times [2018-01-28 21:34:24,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:24,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:24,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:24,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:24,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:24,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:24,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:24,275 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:24,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:24,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:24,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:24,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:24,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:24,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-28 21:34:24,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-01-28 21:34:24,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:24,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:34:24,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-28 21:34:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:24,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:24,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-28 21:34:24,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:34:24,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:34:24,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:34:24,538 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-01-28 21:34:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:24,795 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-28 21:34:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:34:24,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-28 21:34:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:24,797 INFO L225 Difference]: With dead ends: 100 [2018-01-28 21:34:24,797 INFO L226 Difference]: Without dead ends: 71 [2018-01-28 21:34:24,798 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:34:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-28 21:34:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-28 21:34:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 21:34:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-28 21:34:24,806 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 30 [2018-01-28 21:34:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:24,806 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-28 21:34:24,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:34:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-28 21:34:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:34:24,808 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:24,808 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:24,808 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash -294686311, now seen corresponding path program 2 times [2018-01-28 21:34:24,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:24,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:24,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:24,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:24,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:24,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:25,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:25,093 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:25,100 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:34:25,116 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:25,121 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:25,122 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:25,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:25,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:25,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:25,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-28 21:34:25,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:25,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:25,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-28 21:34:25,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:34:25,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:34:25,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:34:25,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:25,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 19 [2018-01-28 21:34:25,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:25,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:34:25,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-28 21:34:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:25,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:25,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-28 21:34:25,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 21:34:25,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 21:34:25,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:34:25,402 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 20 states. [2018-01-28 21:34:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:26,292 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-28 21:34:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 21:34:26,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-01-28 21:34:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:26,294 INFO L225 Difference]: With dead ends: 105 [2018-01-28 21:34:26,294 INFO L226 Difference]: Without dead ends: 76 [2018-01-28 21:34:26,295 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 21:34:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-28 21:34:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-01-28 21:34:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-28 21:34:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-28 21:34:26,303 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 36 [2018-01-28 21:34:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:26,304 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-28 21:34:26,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 21:34:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-28 21:34:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 21:34:26,305 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:26,306 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:26,306 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1273956393, now seen corresponding path program 1 times [2018-01-28 21:34:26,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:26,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:26,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:26,307 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:26,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:26,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:26,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:26,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:26,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:26,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:26,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:26,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-28 21:34:26,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:34:26,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:34:26,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:34:26,668 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-01-28 21:34:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:26,778 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-28 21:34:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:34:26,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-28 21:34:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:26,779 INFO L225 Difference]: With dead ends: 110 [2018-01-28 21:34:26,779 INFO L226 Difference]: Without dead ends: 82 [2018-01-28 21:34:26,779 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:34:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-28 21:34:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-01-28 21:34:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 21:34:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-01-28 21:34:26,786 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 45 [2018-01-28 21:34:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:26,786 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-01-28 21:34:26,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:34:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-01-28 21:34:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:34:26,787 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:26,788 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:26,788 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash -225814477, now seen corresponding path program 2 times [2018-01-28 21:34:26,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:26,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:26,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:26,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:26,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:26,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:26,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:26,947 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:26,952 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:34:26,969 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:26,972 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:26,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:26,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:26,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:27,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:34:27,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-28 21:34:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-28 21:34:27,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:34:27,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2018-01-28 21:34:27,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 21:34:27,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 21:34:27,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:34:27,223 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-01-28 21:34:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:27,772 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-28 21:34:27,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:34:27,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-01-28 21:34:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:27,773 INFO L225 Difference]: With dead ends: 113 [2018-01-28 21:34:27,773 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:34:27,774 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:34:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:34:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-01-28 21:34:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-28 21:34:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-01-28 21:34:27,784 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 51 [2018-01-28 21:34:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:27,784 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-01-28 21:34:27,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 21:34:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-01-28 21:34:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-28 21:34:27,785 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:27,785 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:27,785 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -921316877, now seen corresponding path program 1 times [2018-01-28 21:34:27,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:27,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:27,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:27,786 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:27,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:27,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:34:27,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:27,921 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:27,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:27,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:34:28,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:28,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-28 21:34:28,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:34:28,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:34:28,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:34:28,150 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 25 states. [2018-01-28 21:34:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:28,397 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2018-01-28 21:34:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:34:28,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-01-28 21:34:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:28,398 INFO L225 Difference]: With dead ends: 118 [2018-01-28 21:34:28,399 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 21:34:28,400 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 21:34:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 21:34:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-01-28 21:34:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:34:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-01-28 21:34:28,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 63 [2018-01-28 21:34:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:28,409 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-01-28 21:34:28,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:34:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-01-28 21:34:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:34:28,411 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:28,411 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:28,411 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1713697661, now seen corresponding path program 2 times [2018-01-28 21:34:28,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:28,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:28,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:28,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:28,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:28,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:34:28,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:28,600 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:28,606 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:34:28,623 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:28,630 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:28,631 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:28,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:34:28,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:28,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-28 21:34:28,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 21:34:28,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 21:34:28,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-28 21:34:28,804 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 29 states. [2018-01-28 21:34:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:29,029 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-01-28 21:34:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:34:29,030 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-28 21:34:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:29,030 INFO L225 Difference]: With dead ends: 124 [2018-01-28 21:34:29,030 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 21:34:29,031 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 21:34:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 21:34:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-01-28 21:34:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-28 21:34:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-01-28 21:34:29,040 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 69 [2018-01-28 21:34:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:29,041 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-01-28 21:34:29,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 21:34:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-01-28 21:34:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-28 21:34:29,042 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:29,042 INFO L330 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:29,042 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -307018361, now seen corresponding path program 3 times [2018-01-28 21:34:29,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:29,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:29,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:29,044 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:29,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:29,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:34:29,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:29,209 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:29,214 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:34:29,227 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:29,231 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:29,232 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:29,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:29,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:29,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:29,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:34:29,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-28 21:34:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-01-28 21:34:29,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:29,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-01-28 21:34:29,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:34:29,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:34:29,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:34:29,470 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 25 states. [2018-01-28 21:34:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:30,262 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-01-28 21:34:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-28 21:34:30,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-28 21:34:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:30,263 INFO L225 Difference]: With dead ends: 136 [2018-01-28 21:34:30,263 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:34:30,264 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=2340, Unknown=0, NotChecked=0, Total=2970 [2018-01-28 21:34:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:34:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-01-28 21:34:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:34:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-01-28 21:34:30,271 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 75 [2018-01-28 21:34:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:30,272 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-01-28 21:34:30,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:34:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-01-28 21:34:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 21:34:30,274 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:30,274 INFO L330 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:30,274 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1495560775, now seen corresponding path program 4 times [2018-01-28 21:34:30,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:30,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:30,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:30,275 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:30,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:30,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-28 21:34:30,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:30,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:30,499 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 21:34:30,532 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:30,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:30,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:30,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:30,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:30,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 21:34:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 140 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:34:31,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:31,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 46 [2018-01-28 21:34:31,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-28 21:34:31,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-28 21:34:31,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-28 21:34:31,164 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 46 states. [2018-01-28 21:34:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:32,999 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-01-28 21:34:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 21:34:33,000 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2018-01-28 21:34:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:33,000 INFO L225 Difference]: With dead ends: 154 [2018-01-28 21:34:33,000 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 21:34:33,002 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1008, Invalid=6302, Unknown=0, NotChecked=0, Total=7310 [2018-01-28 21:34:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 21:34:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-01-28 21:34:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 21:34:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-01-28 21:34:33,008 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 87 [2018-01-28 21:34:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:33,008 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-01-28 21:34:33,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-28 21:34:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-01-28 21:34:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 21:34:33,010 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:33,010 INFO L330 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:33,010 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -552939513, now seen corresponding path program 5 times [2018-01-28 21:34:33,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:33,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:33,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:33,011 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:33,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:33,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-28 21:34:33,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:33,254 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-28 21:34:33,259 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-28 21:34:33,267 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,269 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,270 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,271 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,274 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,276 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,280 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,294 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,327 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:33,329 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:33,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-28 21:34:33,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:33,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-28 21:34:33,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 21:34:33,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 21:34:33,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 21:34:33,590 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 41 states. [2018-01-28 21:34:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:33,938 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-01-28 21:34:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 21:34:33,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-28 21:34:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:33,939 INFO L225 Difference]: With dead ends: 164 [2018-01-28 21:34:33,939 INFO L226 Difference]: Without dead ends: 125 [2018-01-28 21:34:33,940 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=964, Invalid=2458, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:34:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-28 21:34:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-01-28 21:34:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-28 21:34:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-01-28 21:34:33,947 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 99 [2018-01-28 21:34:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:33,947 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-01-28 21:34:33,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 21:34:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-01-28 21:34:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 21:34:33,948 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:33,948 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:33,948 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:33,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1688898415, now seen corresponding path program 6 times [2018-01-28 21:34:33,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:33,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:33,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:33,949 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:33,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:33,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-28 21:34:34,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:34,185 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:34,190 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-28 21:34:34,205 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:34:34,208 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:34:34,211 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:34:34,212 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:34,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:34,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:34,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:34:34,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-28 21:34:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-28 21:34:34,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:34:34,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2018-01-28 21:34:34,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:34:34,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:34:34,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:34:34,620 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 32 states. [2018-01-28 21:34:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:36,110 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-01-28 21:34:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-28 21:34:36,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-01-28 21:34:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:36,112 INFO L225 Difference]: With dead ends: 169 [2018-01-28 21:34:36,112 INFO L226 Difference]: Without dead ends: 130 [2018-01-28 21:34:36,114 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1127, Invalid=4423, Unknown=0, NotChecked=0, Total=5550 [2018-01-28 21:34:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-28 21:34:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-01-28 21:34:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-28 21:34:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-01-28 21:34:36,125 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 105 [2018-01-28 21:34:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:36,125 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-01-28 21:34:36,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:34:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-01-28 21:34:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-28 21:34:36,127 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:36,127 INFO L330 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:36,127 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash -329584181, now seen corresponding path program 1 times [2018-01-28 21:34:36,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:36,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:36,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:36,128 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:36,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:36,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-01-28 21:34:36,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:36,255 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:36,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:36,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 21:34:36,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:36,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26] total 33 [2018-01-28 21:34:36,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:34:36,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:34:36,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:34:36,612 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 33 states. [2018-01-28 21:34:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:37,032 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-01-28 21:34:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 21:34:37,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-01-28 21:34:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:37,034 INFO L225 Difference]: With dead ends: 181 [2018-01-28 21:34:37,034 INFO L226 Difference]: Without dead ends: 144 [2018-01-28 21:34:37,035 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=957, Invalid=2825, Unknown=0, NotChecked=0, Total=3782 [2018-01-28 21:34:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-28 21:34:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2018-01-28 21:34:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-28 21:34:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-01-28 21:34:37,044 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 117 [2018-01-28 21:34:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:37,044 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-01-28 21:34:37,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:34:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-01-28 21:34:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-28 21:34:37,045 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:37,045 INFO L330 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:37,046 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -576261493, now seen corresponding path program 2 times [2018-01-28 21:34:37,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:37,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:37,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:37,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:34:37,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:37,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-28 21:34:37,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:37,173 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:37,178 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:34:37,195 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:37,210 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:34:37,213 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:37,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-28 21:34:37,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:37,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 37 [2018-01-28 21:34:37,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 21:34:37,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 21:34:37,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 21:34:37,533 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 37 states. [2018-01-28 21:34:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:38,031 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-01-28 21:34:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-28 21:34:38,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 129 [2018-01-28 21:34:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:38,032 INFO L225 Difference]: With dead ends: 199 [2018-01-28 21:34:38,032 INFO L226 Difference]: Without dead ends: 156 [2018-01-28 21:34:38,034 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1174, Invalid=3656, Unknown=0, NotChecked=0, Total=4830 [2018-01-28 21:34:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-28 21:34:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2018-01-28 21:34:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-28 21:34:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-01-28 21:34:38,042 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 129 [2018-01-28 21:34:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:38,042 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-01-28 21:34:38,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 21:34:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-01-28 21:34:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-28 21:34:38,044 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:38,044 INFO L330 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:38,044 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 473424971, now seen corresponding path program 3 times [2018-01-28 21:34:38,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:38,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:38,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:38,045 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:38,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:38,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-01-28 21:34:38,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:38,251 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:38,258 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:34:38,281 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,288 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,293 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,299 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,309 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:34:38,325 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:38,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 74 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-28 21:34:38,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:34:38,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-28 21:34:38,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 21:34:38,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 21:34:38,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-01-28 21:34:38,557 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 31 states. [2018-01-28 21:34:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:34:38,830 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-01-28 21:34:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 21:34:38,830 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-01-28 21:34:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:34:38,831 INFO L225 Difference]: With dead ends: 175 [2018-01-28 21:34:38,831 INFO L226 Difference]: Without dead ends: 159 [2018-01-28 21:34:38,832 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:34:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-28 21:34:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-01-28 21:34:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-28 21:34:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-01-28 21:34:38,842 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 141 [2018-01-28 21:34:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:34:38,842 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-01-28 21:34:38,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 21:34:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-01-28 21:34:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-28 21:34:38,843 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:34:38,844 INFO L330 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:34:38,844 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-28 21:34:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1644437887, now seen corresponding path program 4 times [2018-01-28 21:34:38,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:34:38,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:34:38,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:38,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:34:38,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:34:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:34:38,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:34:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-01-28 21:34:39,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:34:39,027 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:34:39,032 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 21:34:39,068 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:34:39,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:34:39,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-28 21:34:39,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:34:39,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:34:39,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:34:39,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:34:39,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:34:39,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:34:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-28 21:34:39,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-28 21:34:39,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-28 21:34:39,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:34:39,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-28 21:36:22,515 WARN L143 SmtUtils]: Spent 220ms on a formula simplification that was a NOOP. DAG size: 76 Received shutdown request... [2018-01-28 21:36:59,657 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 21:36:59,657 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:36:59,662 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:36:59,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:36:59 BoogieIcfgContainer [2018-01-28 21:36:59,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:36:59,663 INFO L168 Benchmark]: Toolchain (without parser) took 157530.25 ms. Allocated memory was 305.1 MB in the beginning and 648.0 MB in the end (delta: 342.9 MB). Free memory was 263.9 MB in the beginning and 357.3 MB in the end (delta: -93.4 MB). Peak memory consumption was 249.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:59,664 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:36:59,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.88 ms. Allocated memory is still 305.1 MB. Free memory was 263.9 MB in the beginning and 253.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:59,665 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 ms. Allocated memory is still 305.1 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:59,665 INFO L168 Benchmark]: RCFGBuilder took 248.93 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 233.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:59,665 INFO L168 Benchmark]: TraceAbstraction took 157046.67 ms. Allocated memory was 305.1 MB in the beginning and 648.0 MB in the end (delta: 342.9 MB). Free memory was 231.0 MB in the beginning and 357.3 MB in the end (delta: -126.3 MB). Peak memory consumption was 216.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:59,667 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.88 ms. Allocated memory is still 305.1 MB. Free memory was 263.9 MB in the beginning and 253.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 305.1 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.93 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 233.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 157046.67 ms. Allocated memory was 305.1 MB in the beginning and 648.0 MB in the end (delta: 342.9 MB). Free memory was 231.0 MB in the beginning and 357.3 MB in the end (delta: -126.3 MB). Peak memory consumption was 216.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 148 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 17 error locations. TIMEOUT Result, 156.9s OverallTime, 18 OverallIterations, 14 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 690 SDtfs, 2527 SDslu, 6743 SDs, 0 SdLazy, 5902 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1534 GetRequests, 882 SyntacticMatches, 8 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8522 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 73 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2146 ConstructedInterpolants, 254 QuantifiedInterpolants, 1006645 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2728 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 2587/5164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-36-59-675.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-36-59-675.csv Completed graceful shutdown