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_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:00:40,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:00:40,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:00:40,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:00:40,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:00:40,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:00:40,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:00:40,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:00:40,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:00:40,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:00:40,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:00:40,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:00:40,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:00:40,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:00:40,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:00:40,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:00:40,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:00:40,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:00:40,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:00:40,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:00:40,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:00:40,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:00:40,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:00:40,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:00:40,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:00:40,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:00:40,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:00:40,960 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:00:40,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:00:40,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:00:40,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:00:40,961 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-29 23:00:40,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:00:40,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:00:40,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:00:40,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:00:40,971 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:00:40,971 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:00:40,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:00:40,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:00:40,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:00:40,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:00:40,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:00:40,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:00:40,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:00:40,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:00:40,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:00:40,974 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:00:40,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:00:40,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:00:40,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:00:40,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:00:40,976 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:00:40,976 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:00:41,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:00:41,018 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:00:41,020 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:00:41,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:00:41,022 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:00:41,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-29 23:00:41,171 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:00:41,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:00:41,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:00:41,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:00:41,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:00:41,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c42bca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41, skipping insertion in model container [2018-01-29 23:00:41,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,199 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:00:41,235 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:00:41,339 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:00:41,354 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:00:41,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41 WrapperNode [2018-01-29 23:00:41,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:00:41,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:00:41,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:00:41,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:00:41,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (1/1) ... [2018-01-29 23:00:41,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:00:41,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:00:41,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:00:41,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:00:41,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (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-29 23:00:41,440 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:00:41,440 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:00:41,440 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:00:41,441 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:00:41,441 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:00:41,442 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:00:41,442 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:00:41,442 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:00:41,636 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:00:41,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:00:41 BoogieIcfgContainer [2018-01-29 23:00:41,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:00:41,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:00:41,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:00:41,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:00:41,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:00:41" (1/3) ... [2018-01-29 23:00:41,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2768bc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:00:41, skipping insertion in model container [2018-01-29 23:00:41,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:41" (2/3) ... [2018-01-29 23:00:41,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2768bc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:00:41, skipping insertion in model container [2018-01-29 23:00:41,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:00:41" (3/3) ... [2018-01-29 23:00:41,644 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-01-29 23:00:41,650 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:00:41,655 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-29 23:00:41,697 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:00:41,697 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:00:41,698 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:00:41,698 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:00:41,698 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:00:41,698 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:00:41,698 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:00:41,698 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:00:41,699 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:00:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-29 23:00:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-29 23:00:41,724 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:41,725 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:00:41,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 608637057, now seen corresponding path program 1 times [2018-01-29 23:00:41,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:41,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:41,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:41,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:41,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:41,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:41,985 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-29 23:00:41,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:00:41,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:00:41,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:00:42,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:00:42,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:00:42,007 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2018-01-29 23:00:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:42,245 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-29 23:00:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:00:42,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-29 23:00:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:42,253 INFO L225 Difference]: With dead ends: 99 [2018-01-29 23:00:42,254 INFO L226 Difference]: Without dead ends: 60 [2018-01-29 23:00:42,256 INFO L553 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-29 23:00:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-29 23:00:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-29 23:00:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-29 23:00:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-29 23:00:42,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 17 [2018-01-29 23:00:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:42,292 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-29 23:00:42,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:00:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-29 23:00:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-29 23:00:42,293 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:42,293 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:00:42,293 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 608637058, now seen corresponding path program 1 times [2018-01-29 23:00:42,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:42,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:42,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:42,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:42,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:42,421 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-29 23:00:42,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:00:42,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:00:42,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:00:42,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:00:42,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:00:42,424 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-01-29 23:00:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:42,610 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-29 23:00:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:00:42,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-29 23:00:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:42,612 INFO L225 Difference]: With dead ends: 60 [2018-01-29 23:00:42,612 INFO L226 Difference]: Without dead ends: 59 [2018-01-29 23:00:42,613 INFO L553 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-29 23:00:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-29 23:00:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-29 23:00:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-29 23:00:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-29 23:00:42,621 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 17 [2018-01-29 23:00:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:42,621 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-29 23:00:42,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:00:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-29 23:00:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:00:42,622 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:42,622 INFO L350 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-29 23:00:42,623 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 186914476, now seen corresponding path program 1 times [2018-01-29 23:00:42,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:42,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:42,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:42,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:42,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:42,697 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-29 23:00:42,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:00:42,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:00:42,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:00:42,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:00:42,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:00:42,699 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-01-29 23:00:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:42,760 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-29 23:00:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:00:42,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 23:00:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:42,761 INFO L225 Difference]: With dead ends: 59 [2018-01-29 23:00:42,761 INFO L226 Difference]: Without dead ends: 56 [2018-01-29 23:00:42,762 INFO L553 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-29 23:00:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-29 23:00:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-29 23:00:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 23:00:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-29 23:00:42,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 24 [2018-01-29 23:00:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:42,768 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-29 23:00:42,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:00:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-29 23:00:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:00:42,769 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:42,769 INFO L350 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-29 23:00:42,769 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 186914477, now seen corresponding path program 1 times [2018-01-29 23:00:42,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:42,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:42,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:42,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:42,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:42,941 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-29 23:00:42,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:00:42,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:00:42,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:00:42,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:00:42,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:00:42,942 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-01-29 23:00:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:43,048 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-01-29 23:00:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:00:43,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-29 23:00:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:43,050 INFO L225 Difference]: With dead ends: 94 [2018-01-29 23:00:43,050 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 23:00:43,050 INFO L553 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-29 23:00:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 23:00:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-29 23:00:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-29 23:00:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-29 23:00:43,056 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 24 [2018-01-29 23:00:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:43,056 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-29 23:00:43,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:00:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-29 23:00:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-29 23:00:43,057 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:43,057 INFO L350 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-29 23:00:43,057 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1679529059, now seen corresponding path program 1 times [2018-01-29 23:00:43,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:43,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:43,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:43,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:43,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:43,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:43,269 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-29 23:00:43,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:43,270 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-29 23:00:43,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:43,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:43,363 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-29 23:00:43,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:43,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:43,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-29 23:00:43,386 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-29 23:00:43,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:43,393 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-29 23:00:43,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-01-29 23:00:43,533 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-29 23:00:43,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:43,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-29 23:00:43,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:00:43,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:00:43,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:00:43,555 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-01-29 23:00:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:43,864 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-29 23:00:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:00:43,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-29 23:00:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:43,869 INFO L225 Difference]: With dead ends: 100 [2018-01-29 23:00:43,869 INFO L226 Difference]: Without dead ends: 71 [2018-01-29 23:00:43,870 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:00:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-29 23:00:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-29 23:00:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 23:00:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-29 23:00:43,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 30 [2018-01-29 23:00:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:43,878 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-29 23:00:43,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:00:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-29 23:00:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:00:43,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:43,880 INFO L350 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-29 23:00:43,881 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash -294686311, now seen corresponding path program 2 times [2018-01-29 23:00:43,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:43,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:43,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:43,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:43,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:43,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:44,131 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-29 23:00:44,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:44,131 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-29 23:00:44,137 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:00:44,155 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:44,162 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:44,163 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:44,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:44,171 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-29 23:00:44,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:44,177 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-29 23:00:44,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:44,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:44,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-29 23:00:44,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:00:44,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:00:44,210 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-29 23:00:44,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:44,218 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-29 23:00:44,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:44,224 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-29 23:00:44,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-29 23:00:44,398 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-29 23:00:44,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:44,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-29 23:00:44,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:00:44,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:00:44,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:00:44,419 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 20 states. [2018-01-29 23:00:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:45,296 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-29 23:00:45,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:00:45,342 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-01-29 23:00:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:45,343 INFO L225 Difference]: With dead ends: 105 [2018-01-29 23:00:45,343 INFO L226 Difference]: Without dead ends: 76 [2018-01-29 23:00:45,344 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:00:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-29 23:00:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-01-29 23:00:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-29 23:00:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-29 23:00:45,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 36 [2018-01-29 23:00:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:45,353 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-29 23:00:45,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:00:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-29 23:00:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:00:45,354 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:45,354 INFO L350 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-29 23:00:45,354 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1273956393, now seen corresponding path program 1 times [2018-01-29 23:00:45,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:45,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:45,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:45,356 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:45,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:45,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:45,472 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-29 23:00:45,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:45,472 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-29 23:00:45,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:45,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:45,600 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-29 23:00:45,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:45,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-29 23:00:45,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:00:45,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:00:45,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:00:45,622 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-01-29 23:00:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:45,732 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-29 23:00:45,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:00:45,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-29 23:00:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:45,733 INFO L225 Difference]: With dead ends: 110 [2018-01-29 23:00:45,733 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 23:00:45,733 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:00:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 23:00:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-01-29 23:00:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 23:00:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-01-29 23:00:45,742 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 45 [2018-01-29 23:00:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:45,743 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-01-29 23:00:45,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:00:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-01-29 23:00:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:00:45,744 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:45,744 INFO L350 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-29 23:00:45,744 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash -225814477, now seen corresponding path program 2 times [2018-01-29 23:00:45,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:45,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:45,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:45,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:45,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:45,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:45,870 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-29 23:00:45,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:45,871 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-29 23:00:45,878 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:00:45,890 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:45,892 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:45,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:45,898 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-29 23:00:45,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:45,909 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-29 23:00:45,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-29 23:00:46,073 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-29 23:00:46,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:00:46,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2018-01-29 23:00:46,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:00:46,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:00:46,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:00:46,098 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-01-29 23:00:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:46,658 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-01-29 23:00:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:00:46,658 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-01-29 23:00:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:46,659 INFO L225 Difference]: With dead ends: 111 [2018-01-29 23:00:46,659 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 23:00:46,660 INFO L553 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-29 23:00:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 23:00:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-01-29 23:00:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 23:00:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-29 23:00:46,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 51 [2018-01-29 23:00:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:46,670 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-29 23:00:46,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:00:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-29 23:00:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 23:00:46,672 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:46,672 INFO L350 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-29 23:00:46,672 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash -921316877, now seen corresponding path program 1 times [2018-01-29 23:00:46,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:46,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:46,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:46,673 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:46,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:46,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:46,798 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-29 23:00:46,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:46,798 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-29 23:00:46,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:46,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:46,980 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-29 23:00:47,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:47,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-29 23:00:47,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:00:47,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:00:47,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:00:47,011 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-01-29 23:00:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:47,219 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-01-29 23:00:47,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:00:47,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-01-29 23:00:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:47,220 INFO L225 Difference]: With dead ends: 114 [2018-01-29 23:00:47,220 INFO L226 Difference]: Without dead ends: 89 [2018-01-29 23:00:47,221 INFO L553 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-29 23:00:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-29 23:00:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-01-29 23:00:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 23:00:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-01-29 23:00:47,230 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 63 [2018-01-29 23:00:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:47,230 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-01-29 23:00:47,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:00:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-01-29 23:00:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:00:47,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:47,232 INFO L350 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-29 23:00:47,232 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1713697661, now seen corresponding path program 2 times [2018-01-29 23:00:47,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:47,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:47,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:47,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:47,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:47,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:47,402 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-29 23:00:47,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:47,403 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-29 23:00:47,413 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:00:47,430 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:47,442 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:47,444 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:47,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:47,689 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-29 23:00:47,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:47,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-29 23:00:47,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:00:47,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:00:47,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:00:47,710 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 29 states. [2018-01-29 23:00:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:48,000 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-01-29 23:00:48,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:00:48,000 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-29 23:00:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:48,001 INFO L225 Difference]: With dead ends: 120 [2018-01-29 23:00:48,001 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 23:00:48,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:00:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 23:00:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-01-29 23:00:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 23:00:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-01-29 23:00:48,011 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 69 [2018-01-29 23:00:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:48,011 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-01-29 23:00:48,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:00:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-01-29 23:00:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:00:48,012 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:48,012 INFO L350 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-29 23:00:48,012 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -307018361, now seen corresponding path program 3 times [2018-01-29 23:00:48,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:48,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:48,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:48,014 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:48,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:48,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:48,177 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-29 23:00:48,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:48,177 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-29 23:00:48,182 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:00:48,194 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:48,198 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:48,199 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:48,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:48,206 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-29 23:00:48,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:48,210 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-29 23:00:48,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-29 23:00:48,370 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-29 23:00:48,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:48,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-01-29 23:00:48,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:00:48,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:00:48,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:00:48,390 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 25 states. [2018-01-29 23:00:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:49,225 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-01-29 23:00:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:00:49,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-29 23:00:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:49,227 INFO L225 Difference]: With dead ends: 132 [2018-01-29 23:00:49,227 INFO L226 Difference]: Without dead ends: 107 [2018-01-29 23:00:49,228 INFO L553 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-29 23:00:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-29 23:00:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-29 23:00:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 23:00:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-01-29 23:00:49,234 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 75 [2018-01-29 23:00:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:49,235 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-01-29 23:00:49,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:00:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-01-29 23:00:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:00:49,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:49,236 INFO L350 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-29 23:00:49,236 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1495560775, now seen corresponding path program 4 times [2018-01-29 23:00:49,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:49,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:49,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:49,237 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:49,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:49,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:49,453 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-29 23:00:49,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:49,453 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-29 23:00:49,458 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:00:49,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:49,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:49,498 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-29 23:00:49,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:49,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:49,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:00:50,099 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-29 23:00:50,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:50,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 46 [2018-01-29 23:00:50,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 23:00:50,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 23:00:50,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:00:50,120 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 46 states. [2018-01-29 23:00:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:52,061 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-01-29 23:00:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:00:52,061 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2018-01-29 23:00:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:52,062 INFO L225 Difference]: With dead ends: 150 [2018-01-29 23:00:52,062 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 23:00:52,064 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1008, Invalid=6302, Unknown=0, NotChecked=0, Total=7310 [2018-01-29 23:00:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 23:00:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-29 23:00:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 23:00:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-01-29 23:00:52,071 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 87 [2018-01-29 23:00:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:52,072 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-01-29 23:00:52,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 23:00:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-01-29 23:00:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:00:52,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:52,073 INFO L350 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-29 23:00:52,073 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash -552939513, now seen corresponding path program 5 times [2018-01-29 23:00:52,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:52,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:52,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:52,074 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:52,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:52,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:52,416 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-29 23:00:52,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:52,417 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-29 23:00:52,422 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:00:52,431 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,434 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,436 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,440 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,443 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,449 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,458 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,467 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,501 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:52,503 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:52,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:52,746 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-29 23:00:52,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:52,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-29 23:00:52,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:00:52,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:00:52,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:00:52,777 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 41 states. [2018-01-29 23:00:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:53,127 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2018-01-29 23:00:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:00:53,127 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-29 23:00:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:53,128 INFO L225 Difference]: With dead ends: 160 [2018-01-29 23:00:53,128 INFO L226 Difference]: Without dead ends: 123 [2018-01-29 23:00:53,130 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=964, Invalid=2458, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:00:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-29 23:00:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-29 23:00:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-29 23:00:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-01-29 23:00:53,138 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 99 [2018-01-29 23:00:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:53,138 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-01-29 23:00:53,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:00:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-01-29 23:00:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-29 23:00:53,139 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:53,139 INFO L350 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-29 23:00:53,139 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1688898415, now seen corresponding path program 6 times [2018-01-29 23:00:53,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:53,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:53,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:53,140 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:53,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:53,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:53,426 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-29 23:00:53,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:53,426 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-29 23:00:53,431 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:00:53,446 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:00:53,451 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:00:53,454 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:00:53,455 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:53,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:53,475 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-29 23:00:53,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:53,508 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-29 23:00:53,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-29 23:00:53,814 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-29 23:00:53,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:00:53,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2018-01-29 23:00:53,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:00:53,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:00:53,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:00:53,836 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 32 states. [2018-01-29 23:00:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:55,290 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-01-29 23:00:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 23:00:55,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-01-29 23:00:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:55,292 INFO L225 Difference]: With dead ends: 165 [2018-01-29 23:00:55,292 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 23:00:55,293 INFO L553 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-29 23:00:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 23:00:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-01-29 23:00:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:00:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-01-29 23:00:55,299 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 105 [2018-01-29 23:00:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:55,300 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-01-29 23:00:55,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:00:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-01-29 23:00:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-29 23:00:55,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:55,301 INFO L350 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-29 23:00:55,301 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash -329584181, now seen corresponding path program 1 times [2018-01-29 23:00:55,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:55,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:55,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:55,302 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:55,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:55,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:55,389 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-29 23:00:55,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:55,389 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-29 23:00:55,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:55,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:55,757 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-29 23:00:55,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:55,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26] total 33 [2018-01-29 23:00:55,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:00:55,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:00:55,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:00:55,778 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 33 states. [2018-01-29 23:00:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:56,362 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-01-29 23:00:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:00:56,362 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-01-29 23:00:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:56,363 INFO L225 Difference]: With dead ends: 177 [2018-01-29 23:00:56,363 INFO L226 Difference]: Without dead ends: 142 [2018-01-29 23:00:56,365 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=957, Invalid=2825, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 23:00:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-29 23:00:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2018-01-29 23:00:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-29 23:00:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-01-29 23:00:56,373 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 117 [2018-01-29 23:00:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:56,373 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-01-29 23:00:56,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:00:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-01-29 23:00:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-29 23:00:56,374 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:56,374 INFO L350 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-29 23:00:56,375 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -576261493, now seen corresponding path program 2 times [2018-01-29 23:00:56,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:56,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:56,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:56,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:00:56,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:56,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:56,539 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-29 23:00:56,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:56,539 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-29 23:00:56,546 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:00:56,562 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:56,576 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:00:56,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:56,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:56,869 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-29 23:00:56,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:56,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 37 [2018-01-29 23:00:56,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:00:56,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:00:56,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:00:56,889 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 37 states. [2018-01-29 23:00:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:57,384 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-01-29 23:00:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 23:00:57,419 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 129 [2018-01-29 23:00:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:57,420 INFO L225 Difference]: With dead ends: 195 [2018-01-29 23:00:57,420 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:00:57,422 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1174, Invalid=3656, Unknown=0, NotChecked=0, Total=4830 [2018-01-29 23:00:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:00:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2018-01-29 23:00:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-29 23:00:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-01-29 23:00:57,429 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 129 [2018-01-29 23:00:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:57,429 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-01-29 23:00:57,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:00:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-01-29 23:00:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 23:00:57,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:57,430 INFO L350 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-29 23:00:57,430 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 473424971, now seen corresponding path program 3 times [2018-01-29 23:00:57,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:57,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:57,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:57,431 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:57,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:57,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:57,619 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-29 23:00:57,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:57,620 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-29 23:00:57,630 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:00:57,652 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,659 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,663 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,670 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,679 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:00:57,689 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:57,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:57,924 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-29 23:00:57,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:00:57,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-29 23:00:57,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:00:57,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:00:57,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:00:57,945 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 31 states. [2018-01-29 23:00:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:00:58,219 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-01-29 23:00:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:00:58,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-01-29 23:00:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:00:58,220 INFO L225 Difference]: With dead ends: 171 [2018-01-29 23:00:58,220 INFO L226 Difference]: Without dead ends: 157 [2018-01-29 23:00:58,221 INFO L553 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-29 23:00:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-29 23:00:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-01-29 23:00:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-29 23:00:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-01-29 23:00:58,229 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 141 [2018-01-29 23:00:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:00:58,230 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-01-29 23:00:58,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:00:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-01-29 23:00:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-29 23:00:58,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:00:58,231 INFO L350 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-29 23:00:58,231 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-29 23:00:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1644437887, now seen corresponding path program 4 times [2018-01-29 23:00:58,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:00:58,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:00:58,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:58,232 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:00:58,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:00:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:00:58,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:00:58,394 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-29 23:00:58,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:00:58,395 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-29 23:00:58,402 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:00:58,436 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:00:58,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:00:58,444 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-29 23:00:58,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:00:58,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:00:58,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:00:58,460 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-29 23:00:58,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 23:00:58,509 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-29 23:00:58,510 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-29 23:00:58,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-29 23:00:58,528 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-29 23:00:58,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:00:58,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-01-29 23:02:40,616 WARN L143 SmtUtils]: Spent 239ms on a formula simplification that was a NOOP. DAG size: 76 [2018-01-29 23:02:56,979 WARN L143 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-29 23:03:14,186 WARN L143 SmtUtils]: Spent 200ms on a formula simplification that was a NOOP. DAG size: 74 Received shutdown request... [2018-01-29 23:03:15,162 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:03:15,163 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:03:15,169 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:03:15,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:03:15 BoogieIcfgContainer [2018-01-29 23:03:15,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:03:15,170 INFO L168 Benchmark]: Toolchain (without parser) took 153998.16 ms. Allocated memory was 305.1 MB in the beginning and 651.7 MB in the end (delta: 346.6 MB). Free memory was 265.2 MB in the beginning and 396.9 MB in the end (delta: -131.8 MB). Peak memory consumption was 214.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:03:15,172 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:03:15,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.36 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:03:15,172 INFO L168 Benchmark]: Boogie Preprocessor took 33.58 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:03:15,173 INFO L168 Benchmark]: RCFGBuilder took 242.46 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 233.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:03:15,173 INFO L168 Benchmark]: TraceAbstraction took 153531.95 ms. Allocated memory was 305.1 MB in the beginning and 651.7 MB in the end (delta: 346.6 MB). Free memory was 233.4 MB in the beginning and 396.9 MB in the end (delta: -163.5 MB). Peak memory consumption was 183.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:03:15,175 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.15 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.36 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.58 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.46 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 233.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153531.95 ms. Allocated memory was 305.1 MB in the beginning and 651.7 MB in the end (delta: 346.6 MB). Free memory was 233.4 MB in the beginning and 396.9 MB in the end (delta: -163.5 MB). Peak memory consumption was 183.1 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 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 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 17 error locations. TIMEOUT Result, 153.4s OverallTime, 18 OverallIterations, 14 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 2479 SDslu, 6340 SDs, 0 SdLazy, 5873 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1534 GetRequests, 882 SyntacticMatches, 8 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8522 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred 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, 6.0s 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_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-03-15-184.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-03-15-184.csv Completed graceful shutdown