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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:14:24,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:14:24,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:14:24,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:14:24,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:14:24,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:14:24,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:14:24,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:14:24,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:14:24,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:14:24,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:14:24,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:14:24,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:14:24,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:14:24,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:14:24,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:14:24,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:14:24,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:14:24,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:14:24,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:14:24,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:14:24,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:14:24,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:14:24,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:14:24,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:14:24,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:14:24,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:14:24,961 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:14:24,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:14:24,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:14:24,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:14:24,962 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:14:24,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:14:24,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:14:24,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:14:24,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:14:24,974 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:14:24,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:14:24,974 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:14:24,974 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:14:24,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:14:24,975 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:14:24,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:14:24,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:14:24,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:14:24,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:14:24,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:14:24,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:14:24,976 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:14:24,977 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:14:24,977 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:14:25,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:14:25,023 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:14:25,026 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:14:25,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:14:25,028 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:14:25,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-04 04:14:25,116 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:14:25,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:14:25,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:25,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:14:25,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:14:25,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318a8b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25, skipping insertion in model container [2018-02-04 04:14:25,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,135 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:25,145 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:25,229 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:25,242 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:25,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25 WrapperNode [2018-02-04 04:14:25,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:25,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:14:25,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:14:25,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:14:25,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... [2018-02-04 04:14:25,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:14:25,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:14:25,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:14:25,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:14:25,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 04:14:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:14:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:14:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 04:14:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:14:25,310 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:14:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:14:25,425 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:14:25,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:25 BoogieIcfgContainer [2018-02-04 04:14:25,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:14:25,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:14:25,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:14:25,428 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:14:25,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:14:25" (1/3) ... [2018-02-04 04:14:25,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3173e420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:25, skipping insertion in model container [2018-02-04 04:14:25,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:25" (2/3) ... [2018-02-04 04:14:25,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3173e420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:25, skipping insertion in model container [2018-02-04 04:14:25,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:25" (3/3) ... [2018-02-04 04:14:25,431 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-04 04:14:25,437 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:14:25,442 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 04:14:25,468 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:14:25,469 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:14:25,469 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:14:25,469 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:14:25,469 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:14:25,469 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:14:25,469 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:14:25,470 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:14:25,470 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:14:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 04:14:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 04:14:25,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,489 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,489 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 04:14:25,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,497 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,542 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:25,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:14:25,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:14:25,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:14:25,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:25,676 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 04:14:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,761 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 04:14:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:14:25,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 04:14:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,768 INFO L225 Difference]: With dead ends: 63 [2018-02-04 04:14:25,769 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:14:25,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:14:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 04:14:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:14:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 04:14:25,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 04:14:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,837 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 04:14:25,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:14:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 04:14:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:14:25,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,837 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,837 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 04:14:25,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:25,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:14:25,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:14:25,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:14:25,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:25,871 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 04:14:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,913 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 04:14:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:14:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 04:14:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,918 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:14:25,918 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 04:14:25,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 04:14:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 04:14:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:14:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 04:14:25,927 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 04:14:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,928 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 04:14:25,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:14:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 04:14:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:14:25,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,929 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 04:14:25,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:26,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:14:26,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:26,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:26,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:26,044 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 04:14:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,167 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 04:14:26,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:14:26,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:14:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,168 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:14:26,169 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:14:26,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:14:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:14:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 04:14:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 04:14:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 04:14:26,173 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 04:14:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,174 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 04:14:26,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 04:14:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:14:26,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,175 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 04:14:26,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:26,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:14:26,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:26,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:26,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:26,212 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 04:14:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,245 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 04:14:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:26,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:14:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,246 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:14:26,247 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:14:26,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:14:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 04:14:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:14:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 04:14:26,250 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 04:14:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,250 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 04:14:26,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 04:14:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:14:26,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,250 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,251 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 04:14:26,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,251 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:26,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:14:26,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:14:26,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:14:26,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:26,305 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-04 04:14:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,379 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 04:14:26,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:14:26,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 04:14:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,381 INFO L225 Difference]: With dead ends: 72 [2018-02-04 04:14:26,381 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 04:14:26,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:14:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 04:14:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-02-04 04:14:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 04:14:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 04:14:26,385 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 22 [2018-02-04 04:14:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,386 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 04:14:26,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:14:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 04:14:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:14:26,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,387 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,387 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 04:14:26,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,387 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:26,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:14:26,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:26,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:26,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:26,425 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-02-04 04:14:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,456 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-04 04:14:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:26,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 04:14:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,457 INFO L225 Difference]: With dead ends: 72 [2018-02-04 04:14:26,457 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 04:14:26,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 04:14:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-02-04 04:14:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 04:14:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 04:14:26,461 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2018-02-04 04:14:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,461 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 04:14:26,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 04:14:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:14:26,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,462 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,462 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 04:14:26,463 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,463 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,463 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:26,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:26,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:26,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:26,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-02-04 04:14:26,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:26,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:26,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:26,565 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-02-04 04:14:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,694 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-04 04:14:26,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:14:26,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 04:14:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,696 INFO L225 Difference]: With dead ends: 102 [2018-02-04 04:14:26,696 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 04:14:26,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:14:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 04:14:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2018-02-04 04:14:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 04:14:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 04:14:26,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-02-04 04:14:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,701 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 04:14:26,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 04:14:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:14:26,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,702 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,703 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-04 04:14:26,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,703 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,704 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:14:26,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:26,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:14:26,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:26,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:26,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:26,772 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 04:14:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,834 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-04 04:14:26,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:26,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 04:14:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,835 INFO L225 Difference]: With dead ends: 83 [2018-02-04 04:14:26,835 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:14:26,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:14:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:14:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-02-04 04:14:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 04:14:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 04:14:26,839 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 34 [2018-02-04 04:14:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,840 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 04:14:26,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 04:14:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 04:14:26,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:26,841 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:26,841 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 2 times [2018-02-04 04:14:26,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:26,841 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:26,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:26,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:26,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:14:26,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:26,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:26,910 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:26,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:14:26,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:26,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:14:26,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:26,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-04 04:14:26,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:26,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:26,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:14:26,949 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 10 states. [2018-02-04 04:14:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:27,064 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 04:14:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:14:27,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 04:14:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:27,065 INFO L225 Difference]: With dead ends: 90 [2018-02-04 04:14:27,066 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 04:14:27,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:14:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 04:14:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2018-02-04 04:14:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 04:14:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 04:14:27,068 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2018-02-04 04:14:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:27,069 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 04:14:27,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 04:14:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 04:14:27,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:27,070 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 04:14:27,070 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 1 times [2018-02-04 04:14:27,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:27,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:27,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:27,071 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:27,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:27,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:14:27,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:27,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:27,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:27,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:14:27,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:27,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 04:14:27,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:27,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:27,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:27,149 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-02-04 04:14:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:27,192 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-04 04:14:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:27,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-04 04:14:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:27,193 INFO L225 Difference]: With dead ends: 98 [2018-02-04 04:14:27,193 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 04:14:27,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 04:14:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-02-04 04:14:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 04:14:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 04:14:27,198 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 49 [2018-02-04 04:14:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:27,198 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 04:14:27,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 04:14:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 04:14:27,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:27,201 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2018-02-04 04:14:27,201 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:14:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1217895456, now seen corresponding path program 2 times [2018-02-04 04:14:27,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:27,201 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:27,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:27,202 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:27,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:27,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 04:14:27,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:27,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:27,256 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:27,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:27,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:27,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:27,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:14:27,308 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 12 treesize of output 5 [2018-02-04 04:14:27,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:27,311 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-02-04 04:14:27,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:14:27,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:14:27,340 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 12 treesize of output 5 [2018-02-04 04:14:27,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:27,341 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-02-04 04:14:27,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:14:27,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:14:27,360 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 12 treesize of output 5 [2018-02-04 04:14:27,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:27,361 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-02-04 04:14:27,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:14:27,377 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-02-04 04:14:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 04:14:27,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:27,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-02-04 04:14:27,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:14:27,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:14:27,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-02-04 04:14:27,392 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2018-02-04 04:14:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:27,617 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-04 04:14:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:14:27,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-02-04 04:14:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:27,618 INFO L225 Difference]: With dead ends: 110 [2018-02-04 04:14:27,618 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 04:14:27,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2018-02-04 04:14:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 04:14:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 04:14:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 04:14:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 04:14:27,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-02-04 04:14:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:27,619 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 04:14:27,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:14:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 04:14:27,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 04:14:27,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:14:27 BoogieIcfgContainer [2018-02-04 04:14:27,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:14:27,624 INFO L168 Benchmark]: Toolchain (without parser) took 2506.93 ms. Allocated memory was 403.2 MB in the beginning and 623.9 MB in the end (delta: 220.7 MB). Free memory was 361.4 MB in the beginning and 420.3 MB in the end (delta: -58.9 MB). Peak memory consumption was 161.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:27,625 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:14:27,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.07 ms. Allocated memory is still 403.2 MB. Free memory was 361.4 MB in the beginning and 353.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:27,625 INFO L168 Benchmark]: Boogie Preprocessor took 23.21 ms. Allocated memory is still 403.2 MB. Free memory was 353.3 MB in the beginning and 352.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:27,625 INFO L168 Benchmark]: RCFGBuilder took 153.56 ms. Allocated memory is still 403.2 MB. Free memory was 350.6 MB in the beginning and 335.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:27,625 INFO L168 Benchmark]: TraceAbstraction took 2197.64 ms. Allocated memory was 403.2 MB in the beginning and 623.9 MB in the end (delta: 220.7 MB). Free memory was 333.8 MB in the beginning and 420.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 134.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:27,627 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 130.07 ms. Allocated memory is still 403.2 MB. Free memory was 361.4 MB in the beginning and 353.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.21 ms. Allocated memory is still 403.2 MB. Free memory was 353.3 MB in the beginning and 352.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 153.56 ms. Allocated memory is still 403.2 MB. Free memory was 350.6 MB in the beginning and 335.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2197.64 ms. Allocated memory was 403.2 MB in the beginning and 623.9 MB in the end (delta: 220.7 MB). Free memory was 333.8 MB in the beginning and 420.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 134.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 2.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 546 SDslu, 840 SDs, 0 SdLazy, 812 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=10, 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 502 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 487 ConstructedInterpolants, 26 QuantifiedInterpolants, 61520 SizeOfPredicates, 3 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 152/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-14-27-634.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-14-27-634.csv Received shutdown request...