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-a74eeac-m [2018-02-02 21:06:03,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:06:03,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:06:03,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:06:03,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:06:03,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:06:03,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:06:03,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:06:03,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:06:03,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:06:03,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:06:03,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:06:03,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:06:03,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:06:03,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:06:03,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:06:03,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:06:03,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:06:03,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:06:03,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:06:03,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:06:03,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:06:03,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:06:03,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:06:03,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:06:03,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:06:03,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:06:03,277 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:06:03,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:06:03,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:06:03,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:06:03,278 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-02 21:06:03,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:06:03,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:06:03,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:06:03,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:06:03,301 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:06:03,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:06:03,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:06:03,302 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:06:03,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:06:03,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:06:03,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:06:03,307 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:06:03,307 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:06:03,307 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:06:03,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:06:03,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:06:03,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:06:03,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:06:03,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:06:03,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:06:03,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:06:03,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:06:03,309 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:06:03,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:06:03,309 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:06:03,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:06:03,368 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:06:03,374 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:06:03,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:06:03,375 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:06:03,376 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-02 21:06:03,489 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:06:03,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:06:03,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:03,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:06:03,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:06:03,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03, skipping insertion in model container [2018-02-02 21:06:03,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,519 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:03,534 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:03,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:03,652 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:03,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03 WrapperNode [2018-02-02 21:06:03,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:03,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:06:03,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:06:03,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:06:03,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (1/1) ... [2018-02-02 21:06:03,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:06:03,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:06:03,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:06:03,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:06:03,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (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-02 21:06:03,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:06:03,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:06:03,726 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 21:06:03,726 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:06:03,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:06:03,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:06:03,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:06:03,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:06:03,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:06:03,727 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 21:06:03,727 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:06:03,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:06:03,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:06:03,913 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:06:03,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:03 BoogieIcfgContainer [2018-02-02 21:06:03,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:06:03,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:06:03,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:06:03,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:06:03,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:06:03" (1/3) ... [2018-02-02 21:06:03,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e0210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:03, skipping insertion in model container [2018-02-02 21:06:03,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:03" (2/3) ... [2018-02-02 21:06:03,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e0210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:03, skipping insertion in model container [2018-02-02 21:06:03,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:03" (3/3) ... [2018-02-02 21:06:03,920 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-02 21:06:03,929 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:06:03,935 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 21:06:03,967 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:06:03,968 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:06:03,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:06:03,968 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:06:03,968 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:06:03,968 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:06:03,968 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:06:03,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:06:03,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:06:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 21:06:03,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 21:06:03,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:03,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:03,994 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 21:06:04,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,001 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,167 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-02 21:06:04,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:06:04,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:06:04,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:06:04,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:04,185 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 21:06:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,236 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 21:06:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:06:04,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 21:06:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,244 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:06:04,244 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:06:04,246 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-02 21:06:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:06:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 21:06:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 21:06:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 21:06:04,316 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 21:06:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,316 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 21:06:04,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:06:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 21:06:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:06:04,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,317 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:04,317 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 21:06:04,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,318 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,358 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-02 21:06:04,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:06:04,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:06:04,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:06:04,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:04,360 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-02 21:06:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,391 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 21:06:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:06:04,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 21:06:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,393 INFO L225 Difference]: With dead ends: 60 [2018-02-02 21:06:04,393 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:06:04,393 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-02 21:06:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:06:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-02 21:06:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 21:06:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 21:06:04,397 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-02 21:06:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,397 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 21:06:04,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:06:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 21:06:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:04,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,398 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:04,398 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,398 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 21:06:04,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,520 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-02 21:06:04,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:04,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:04,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:04,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:04,522 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-02 21:06:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,600 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 21:06:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:04,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 21:06:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,602 INFO L225 Difference]: With dead ends: 54 [2018-02-02 21:06:04,602 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 21:06:04,602 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-02 21:06:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 21:06:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-02 21:06:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 21:06:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 21:06:04,607 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-02 21:06:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,607 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 21:06:04,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 21:06:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:04,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,608 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:04,608 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 21:06:04,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,655 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-02 21:06:04,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:06:04,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:04,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:04,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:04,656 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-02 21:06:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,691 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 21:06:04,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:04,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:06:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,692 INFO L225 Difference]: With dead ends: 50 [2018-02-02 21:06:04,692 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 21:06:04,693 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-02 21:06:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 21:06:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 21:06:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 21:06:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 21:06:04,696 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-02 21:06:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,697 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 21:06:04,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 21:06:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 21:06:04,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,698 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-02 21:06:04,698 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 21:06:04,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,698 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,759 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-02 21:06:04,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:06:04,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:06:04,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:06:04,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:06:04,760 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-02 21:06:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,833 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-02 21:06:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:04,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 21:06:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,834 INFO L225 Difference]: With dead ends: 72 [2018-02-02 21:06:04,834 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 21:06:04,835 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-02 21:06:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 21:06:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-02-02 21:06:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 21:06:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 21:06:04,839 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 22 [2018-02-02 21:06:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,839 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 21:06:04,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:06:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 21:06:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:06:04,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,840 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-02 21:06:04,840 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 21:06:04,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,885 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-02 21:06:04,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:04,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:06:04,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:04,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:04,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:04,887 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-02-02 21:06:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:04,918 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-02 21:06:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:04,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 21:06:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:04,919 INFO L225 Difference]: With dead ends: 72 [2018-02-02 21:06:04,919 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 21:06:04,919 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-02 21:06:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 21:06:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-02-02 21:06:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:06:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 21:06:04,923 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2018-02-02 21:06:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:04,923 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 21:06:04,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 21:06:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 21:06:04,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:04,925 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-02 21:06:04,925 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 21:06:04,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:04,925 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:04,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:04,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:04,983 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-02 21:06:04,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:04,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:04,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:05,043 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-02 21:06:05,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:05,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-02-02 21:06:05,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:05,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:05,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:05,045 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-02-02 21:06:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:05,184 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-02 21:06:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:06:05,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 21:06:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:05,186 INFO L225 Difference]: With dead ends: 102 [2018-02-02 21:06:05,186 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 21:06:05,186 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-02 21:06:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 21:06:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2018-02-02 21:06:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 21:06:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 21:06:05,189 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-02-02 21:06:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:05,189 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 21:06:05,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 21:06:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:06:05,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:05,190 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-02 21:06:05,190 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-02 21:06:05,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:05,190 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:05,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:05,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:05,238 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-02 21:06:05,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:05,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:06:05,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:05,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:05,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:05,240 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-02 21:06:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:05,293 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-02 21:06:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:05,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 21:06:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:05,294 INFO L225 Difference]: With dead ends: 83 [2018-02-02 21:06:05,294 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 21:06:05,294 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-02 21:06:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 21:06:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-02-02 21:06:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 21:06:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-02 21:06:05,298 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 34 [2018-02-02 21:06:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:05,298 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-02 21:06:05,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-02 21:06:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 21:06:05,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:05,299 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-02 21:06:05,299 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 2 times [2018-02-02 21:06:05,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:05,299 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:05,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:05,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:05,362 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-02 21:06:05,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:05,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:05,364 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:05,380 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:06:05,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:05,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:05,411 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-02 21:06:05,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:05,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-02 21:06:05,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:05,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:05,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:05,412 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 10 states. [2018-02-02 21:06:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:05,509 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-02 21:06:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:06:05,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 21:06:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:05,511 INFO L225 Difference]: With dead ends: 90 [2018-02-02 21:06:05,511 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 21:06:05,511 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-02 21:06:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 21:06:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2018-02-02 21:06:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 21:06:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-02 21:06:05,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2018-02-02 21:06:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:05,518 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-02 21:06:05,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-02 21:06:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 21:06:05,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:05,519 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-02 21:06:05,519 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 1 times [2018-02-02 21:06:05,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:05,520 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:05,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,521 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:05,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:05,570 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-02 21:06:05,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:05,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:05,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:05,595 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-02 21:06:05,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:05,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 21:06:05,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:05,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:05,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:05,596 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-02-02 21:06:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:05,633 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-02 21:06:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:05,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-02 21:06:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:05,634 INFO L225 Difference]: With dead ends: 98 [2018-02-02 21:06:05,634 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 21:06:05,635 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-02 21:06:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 21:06:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-02-02 21:06:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 21:06:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 21:06:05,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 49 [2018-02-02 21:06:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:05,638 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 21:06:05,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 21:06:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 21:06:05,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:05,643 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-02 21:06:05,643 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:06:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1217895456, now seen corresponding path program 2 times [2018-02-02 21:06:05,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:05,644 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:05,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:05,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:05,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:05,684 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-02 21:06:05,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:05,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:05,685 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:05,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:06:05,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:05,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:05,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:05,734 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-02 21:06:05,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:05,736 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-02 21:06:05,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:06:05,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:05,776 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-02 21:06:05,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:05,778 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-02 21:06:05,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:06:05,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:05,802 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-02 21:06:05,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:05,803 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-02 21:06:05,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:06:05,827 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-02 21:06:05,837 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-02 21:06:05,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:05,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-02-02 21:06:05,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:05,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:05,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-02-02 21:06:05,838 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2018-02-02 21:06:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:06,037 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-02 21:06:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:06:06,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-02-02 21:06:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:06,038 INFO L225 Difference]: With dead ends: 110 [2018-02-02 21:06:06,038 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 21:06:06,038 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-02 21:06:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 21:06:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 21:06:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 21:06:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 21:06:06,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-02-02 21:06:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:06,039 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 21:06:06,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 21:06:06,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 21:06:06,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:06:06 BoogieIcfgContainer [2018-02-02 21:06:06,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:06:06,044 INFO L168 Benchmark]: Toolchain (without parser) took 2554.87 ms. Allocated memory was 392.2 MB in the beginning and 601.9 MB in the end (delta: 209.7 MB). Free memory was 347.3 MB in the beginning and 402.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 155.0 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:06,046 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 392.2 MB. Free memory is still 352.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:06:06,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.79 ms. Allocated memory is still 392.2 MB. Free memory was 347.3 MB in the beginning and 339.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:06,046 INFO L168 Benchmark]: Boogie Preprocessor took 26.01 ms. Allocated memory is still 392.2 MB. Free memory was 339.2 MB in the beginning and 337.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:06,046 INFO L168 Benchmark]: RCFGBuilder took 230.02 ms. Allocated memory is still 392.2 MB. Free memory was 336.6 MB in the beginning and 320.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:06,046 INFO L168 Benchmark]: TraceAbstraction took 2129.92 ms. Allocated memory was 392.2 MB in the beginning and 601.9 MB in the end (delta: 209.7 MB). Free memory was 319.2 MB in the beginning and 402.0 MB in the end (delta: -82.8 MB). Peak memory consumption was 126.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:06,048 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.13 ms. Allocated memory is still 392.2 MB. Free memory is still 352.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.79 ms. Allocated memory is still 392.2 MB. Free memory was 347.3 MB in the beginning and 339.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.01 ms. Allocated memory is still 392.2 MB. Free memory was 339.2 MB in the beginning and 337.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 230.02 ms. Allocated memory is still 392.2 MB. Free memory was 336.6 MB in the beginning and 320.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2129.92 ms. Allocated memory was 392.2 MB in the beginning and 601.9 MB in the end (delta: 209.7 MB). Free memory was 319.2 MB in the beginning and 402.0 MB in the end (delta: -82.8 MB). Peak memory consumption was 126.9 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.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 0.8s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s 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-02_21-06-06-054.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-02_21-06-06-054.csv Received shutdown request...