java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:53:46,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:53:46,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:53:46,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:53:46,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:53:46,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:53:46,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:53:46,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:53:46,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:53:46,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:53:46,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:53:46,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:53:46,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:53:46,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:53:46,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:53:46,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:53:46,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:53:46,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:53:46,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:53:46,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:53:46,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:53:46,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:53:46,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:53:46,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:53:46,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:53:46,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:53:46,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:53:46,998 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:53:46,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:53:46,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:53:46,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:53:46,999 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:53:47,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:53:47,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:53:47,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:53:47,011 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:53:47,011 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:53:47,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:53:47,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:53:47,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:53:47,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:53:47,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:53:47,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:53:47,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:53:47,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:53:47,013 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:53:47,013 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:53:47,014 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:53:47,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:53:47,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:53:47,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:53:47,014 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:53:47,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:53:47,015 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:53:47,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:53:47,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:53:47,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:53:47,016 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:53:47,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:53:47,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:53:47,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:53:47,017 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:53:47,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:53:47,017 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:53:47,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:53:47,018 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:53:47,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:53:47,066 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:53:47,070 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:53:47,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:53:47,072 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:53:47,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-29 23:53:47,189 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:53:47,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:53:47,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:53:47,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:53:47,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:53:47,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfb4988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47, skipping insertion in model container [2018-01-29 23:53:47,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,216 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:53:47,230 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:53:47,344 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:53:47,361 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:53:47,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47 WrapperNode [2018-01-29 23:53:47,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:53:47,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:53:47,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:53:47,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:53:47,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... [2018-01-29 23:53:47,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:53:47,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:53:47,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:53:47,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:53:47,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:53:47,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:53:47,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:53:47,469 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:53:47,469 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:53:47,469 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:53:47,469 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:53:47,469 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:53:47,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:53:47,708 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:53:47,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:53:47 BoogieIcfgContainer [2018-01-29 23:53:47,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:53:47,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:53:47,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:53:47,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:53:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:53:47" (1/3) ... [2018-01-29 23:53:47,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499c28e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:53:47, skipping insertion in model container [2018-01-29 23:53:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:53:47" (2/3) ... [2018-01-29 23:53:47,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499c28e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:53:47, skipping insertion in model container [2018-01-29 23:53:47,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:53:47" (3/3) ... [2018-01-29 23:53:47,714 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-29 23:53:47,721 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:53:47,727 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-29 23:53:47,773 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:53:47,773 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:53:47,773 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:53:47,773 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:53:47,773 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:53:47,773 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:53:47,774 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:53:47,774 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:53:47,774 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:53:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-29 23:53:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-29 23:53:47,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:47,798 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:47,798 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1751798805, now seen corresponding path program 1 times [2018-01-29 23:53:47,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:47,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:47,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:47,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:47,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:47,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:48,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:48,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:53:48,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:53:48,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:53:48,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:53:48,030 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-29 23:53:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:48,114 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-29 23:53:48,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:53:48,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-29 23:53:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:48,126 INFO L225 Difference]: With dead ends: 138 [2018-01-29 23:53:48,126 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 23:53:48,130 INFO L553 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-01-29 23:53:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 23:53:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-01-29 23:53:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 23:53:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-29 23:53:48,238 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2018-01-29 23:53:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:48,239 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-29 23:53:48,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:53:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-29 23:53:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:53:48,240 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:48,240 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:48,240 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:48,240 INFO L82 PathProgramCache]: Analyzing trace with hash -177512800, now seen corresponding path program 1 times [2018-01-29 23:53:48,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:48,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:48,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:48,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:48,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:48,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:48,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:53:48,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:53:48,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:53:48,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:53:48,304 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 3 states. [2018-01-29 23:53:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:48,378 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-29 23:53:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:53:48,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-29 23:53:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:48,382 INFO L225 Difference]: With dead ends: 82 [2018-01-29 23:53:48,382 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 23:53:48,383 INFO L553 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-01-29 23:53:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 23:53:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2018-01-29 23:53:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 23:53:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-29 23:53:48,393 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-29 23:53:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:48,393 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-29 23:53:48,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:53:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-29 23:53:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:53:48,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:48,395 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:48,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1207929453, now seen corresponding path program 1 times [2018-01-29 23:53:48,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:48,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:48,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:48,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:48,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:48,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:48,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:53:48,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:53:48,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:53:48,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:53:48,498 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-01-29 23:53:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:48,583 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-01-29 23:53:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:53:48,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-29 23:53:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:48,584 INFO L225 Difference]: With dead ends: 71 [2018-01-29 23:53:48,585 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 23:53:48,585 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:53:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 23:53:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-29 23:53:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 23:53:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-01-29 23:53:48,594 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2018-01-29 23:53:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:48,594 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-01-29 23:53:48,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:53:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-01-29 23:53:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:53:48,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:48,596 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:48,596 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1207929452, now seen corresponding path program 1 times [2018-01-29 23:53:48,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:48,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:48,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:48,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:48,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:48,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:53:48,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:53:48,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:53:48,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:53:48,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:53:48,754 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 7 states. [2018-01-29 23:53:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:48,933 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-29 23:53:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:53:48,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-29 23:53:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:48,935 INFO L225 Difference]: With dead ends: 79 [2018-01-29 23:53:48,935 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 23:53:48,935 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:53:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 23:53:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-01-29 23:53:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 23:53:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-29 23:53:48,941 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-01-29 23:53:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:48,942 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-29 23:53:48,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:53:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-29 23:53:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:53:48,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:48,943 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:48,943 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1743777157, now seen corresponding path program 1 times [2018-01-29 23:53:48,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:48,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:48,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:48,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:48,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:49,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:49,033 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:49,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:49,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:49,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:49,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-29 23:53:49,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:53:49,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:53:49,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:53:49,134 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-01-29 23:53:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:49,243 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-01-29 23:53:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:53:49,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-29 23:53:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:49,245 INFO L225 Difference]: With dead ends: 92 [2018-01-29 23:53:49,245 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 23:53:49,246 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:53:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 23:53:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-29 23:53:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 23:53:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-29 23:53:49,255 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 34 [2018-01-29 23:53:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:49,256 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-29 23:53:49,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:53:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-29 23:53:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 23:53:49,257 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:49,257 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:49,257 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1777482929, now seen corresponding path program 1 times [2018-01-29 23:53:49,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:49,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:49,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:49,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:49,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:49,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:49,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:49,466 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:49,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:49,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:49,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:53:49,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:49,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:49,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:49,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:49,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:53:49,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:53:49,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:53:49,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:53:49,587 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 9 states. [2018-01-29 23:53:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:49,842 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-01-29 23:53:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:53:49,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-29 23:53:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:49,844 INFO L225 Difference]: With dead ends: 91 [2018-01-29 23:53:49,844 INFO L226 Difference]: Without dead ends: 90 [2018-01-29 23:53:49,845 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:53:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-29 23:53:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2018-01-29 23:53:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 23:53:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-29 23:53:49,857 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 35 [2018-01-29 23:53:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:49,858 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-29 23:53:49,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:53:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-29 23:53:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:53:49,859 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:49,859 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:49,860 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1833243520, now seen corresponding path program 1 times [2018-01-29 23:53:49,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:49,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:49,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:49,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:49,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:49,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:49,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:49,916 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:49,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:49,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:50,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:53:50,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-29 23:53:50,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:53:50,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:53:50,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:53:50,012 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 9 states. [2018-01-29 23:53:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:50,165 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-01-29 23:53:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:53:50,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-29 23:53:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:50,166 INFO L225 Difference]: With dead ends: 174 [2018-01-29 23:53:50,166 INFO L226 Difference]: Without dead ends: 107 [2018-01-29 23:53:50,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:53:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-29 23:53:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2018-01-29 23:53:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 23:53:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-29 23:53:50,177 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 37 [2018-01-29 23:53:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:50,178 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-29 23:53:50,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:53:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-29 23:53:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:53:50,180 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:50,180 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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-01-29 23:53:50,180 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -866299840, now seen corresponding path program 2 times [2018-01-29 23:53:50,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:50,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:50,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:50,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:50,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:50,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:50,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:50,264 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:50,271 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:50,282 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:50,291 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:50,292 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:50,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:53:50,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:50,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-01-29 23:53:50,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:53:50,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:53:50,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:50,466 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-01-29 23:53:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:50,835 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-01-29 23:53:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:53:50,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-01-29 23:53:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:50,836 INFO L225 Difference]: With dead ends: 111 [2018-01-29 23:53:50,837 INFO L226 Difference]: Without dead ends: 110 [2018-01-29 23:53:50,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:53:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-29 23:53:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-01-29 23:53:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 23:53:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-29 23:53:50,847 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 43 [2018-01-29 23:53:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:50,848 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-29 23:53:50,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:53:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-29 23:53:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:53:50,849 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:50,849 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2018-01-29 23:53:50,849 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1085491212, now seen corresponding path program 2 times [2018-01-29 23:53:50,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:50,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:50,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:50,850 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:50,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:50,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:51,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:51,095 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:51,099 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:51,107 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:51,111 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:51,111 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:51,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:51,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:53:51,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:51,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:51,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:51,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:51,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-01-29 23:53:51,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:53:51,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:53:51,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:53:51,176 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-01-29 23:53:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:51,381 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-29 23:53:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:53:51,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-29 23:53:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:51,382 INFO L225 Difference]: With dead ends: 110 [2018-01-29 23:53:51,382 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 23:53:51,382 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:53:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 23:53:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-01-29 23:53:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 23:53:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-29 23:53:51,391 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-01-29 23:53:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:51,391 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-29 23:53:51,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:53:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-29 23:53:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 23:53:51,392 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:51,392 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 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-01-29 23:53:51,392 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1896469265, now seen corresponding path program 3 times [2018-01-29 23:53:51,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:51,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:51,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:51,394 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:51,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:51,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 23:53:51,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:51,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:51,661 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:53:51,674 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:51,678 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:51,685 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:51,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:51,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:53:51,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:51,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:51,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:53:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 23:53:51,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:51,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-29 23:53:51,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:53:51,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:53:51,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:53:51,904 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 20 states. [2018-01-29 23:53:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:52,247 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-01-29 23:53:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:53:52,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-01-29 23:53:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:52,248 INFO L225 Difference]: With dead ends: 99 [2018-01-29 23:53:52,249 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 23:53:52,249 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:53:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 23:53:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-01-29 23:53:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 23:53:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-29 23:53:52,260 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 53 [2018-01-29 23:53:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:52,261 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-29 23:53:52,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:53:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-29 23:53:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 23:53:52,262 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:52,262 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:52,262 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:52,263 INFO L82 PathProgramCache]: Analyzing trace with hash -562283937, now seen corresponding path program 1 times [2018-01-29 23:53:52,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:52,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:52,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:52,264 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:52,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:52,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 23:53:52,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:52,401 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:52,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:52,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:53:52,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:52,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-29 23:53:52,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:53:52,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:53:52,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:53:52,505 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 12 states. [2018-01-29 23:53:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:52,680 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-01-29 23:53:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:53:52,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-01-29 23:53:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:52,681 INFO L225 Difference]: With dead ends: 157 [2018-01-29 23:53:52,682 INFO L226 Difference]: Without dead ends: 93 [2018-01-29 23:53:52,682 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:53:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-29 23:53:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-01-29 23:53:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 23:53:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-29 23:53:52,691 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 76 [2018-01-29 23:53:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:52,691 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-29 23:53:52,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:53:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-29 23:53:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-29 23:53:52,693 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:52,693 INFO L350 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:52,693 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -416134581, now seen corresponding path program 2 times [2018-01-29 23:53:52,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:52,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:52,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:52,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:52,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:52,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:53:52,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:52,862 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:52,867 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:52,878 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:52,892 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:52,893 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:52,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 63 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-29 23:53:52,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:52,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-29 23:53:52,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:53:52,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:53:52,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:52,988 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 16 states. [2018-01-29 23:53:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:53,189 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-01-29 23:53:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:53:53,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2018-01-29 23:53:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:53,190 INFO L225 Difference]: With dead ends: 175 [2018-01-29 23:53:53,190 INFO L226 Difference]: Without dead ends: 102 [2018-01-29 23:53:53,191 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:53:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-29 23:53:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-01-29 23:53:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-29 23:53:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-01-29 23:53:53,198 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 94 [2018-01-29 23:53:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:53,198 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-01-29 23:53:53,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:53:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-01-29 23:53:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-29 23:53:53,199 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:53,199 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:53,199 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1046721695, now seen corresponding path program 3 times [2018-01-29 23:53:53,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:53,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:53,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:53,201 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:53,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:53,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:53,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:53,326 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:53,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:53:53,343 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:53,348 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:53,354 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:53,356 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:53,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:53,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:53:53,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-29 23:53:53,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:53:53,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:53:53,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:53:53,426 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 10 states. [2018-01-29 23:53:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:53,531 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-29 23:53:53,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:53:53,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-01-29 23:53:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:53,532 INFO L225 Difference]: With dead ends: 112 [2018-01-29 23:53:53,532 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 23:53:53,533 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:53:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 23:53:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2018-01-29 23:53:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-29 23:53:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-01-29 23:53:53,539 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 112 [2018-01-29 23:53:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:53,539 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-01-29 23:53:53,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:53:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-01-29 23:53:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-29 23:53:53,541 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:53,541 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:53:53,541 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash 511743547, now seen corresponding path program 1 times [2018-01-29 23:53:53,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:53,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:53,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:53,543 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:53,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:53,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:53:53,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:53,673 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:53,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:53,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 110 proven. 33 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-29 23:53:53,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:53,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-01-29 23:53:53,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:53:53,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:53:53,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:53:53,868 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 16 states. [2018-01-29 23:53:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:54,052 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-01-29 23:53:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:53:54,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 119 [2018-01-29 23:53:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:54,053 INFO L225 Difference]: With dead ends: 214 [2018-01-29 23:53:54,053 INFO L226 Difference]: Without dead ends: 135 [2018-01-29 23:53:54,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:53:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-29 23:53:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2018-01-29 23:53:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 23:53:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-29 23:53:54,063 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 119 [2018-01-29 23:53:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:54,064 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-29 23:53:54,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:53:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-29 23:53:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-01-29 23:53:54,066 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:54,066 INFO L350 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-29 23:53:54,067 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 831818138, now seen corresponding path program 2 times [2018-01-29 23:53:54,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:54,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:54,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:54,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:54,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:54,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 195 proven. 231 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-01-29 23:53:54,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:54,394 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:54,398 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:54,409 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:54,410 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:54,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:54,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:54,433 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-01-29 23:53:54,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:54,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:53:54,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:54,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:54,532 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-01-29 23:53:54,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:54,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:53:54,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:54,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:54,606 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-01-29 23:53:54,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:54,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:53:54,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:53:54,668 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-29 23:53:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-01-29 23:53:54,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:53:54,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2018-01-29 23:53:54,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:53:54,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:53:54,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=186, Unknown=1, NotChecked=28, Total=272 [2018-01-29 23:53:54,796 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 17 states. [2018-01-29 23:53:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:55,200 INFO L93 Difference]: Finished difference Result 227 states and 240 transitions. [2018-01-29 23:53:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:53:55,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 194 [2018-01-29 23:53:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:55,201 INFO L225 Difference]: With dead ends: 227 [2018-01-29 23:53:55,201 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 23:53:55,202 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 186 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=747, Unknown=1, NotChecked=62, Total=1122 [2018-01-29 23:53:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 23:53:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-01-29 23:53:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 23:53:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-01-29 23:53:55,209 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 194 [2018-01-29 23:53:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:55,210 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-01-29 23:53:55,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:53:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-01-29 23:53:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-01-29 23:53:55,211 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:55,211 INFO L350 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:55,211 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1729017191, now seen corresponding path program 1 times [2018-01-29 23:53:55,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:55,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:55,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:55,212 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:55,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:55,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-01-29 23:53:55,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:55,344 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:55,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:55,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 522 proven. 100 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-01-29 23:53:55,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:55,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 19 [2018-01-29 23:53:55,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:53:55,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:53:55,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:53:55,555 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 19 states. [2018-01-29 23:53:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:55,771 INFO L93 Difference]: Finished difference Result 239 states and 250 transitions. [2018-01-29 23:53:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:53:55,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 223 [2018-01-29 23:53:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:55,772 INFO L225 Difference]: With dead ends: 239 [2018-01-29 23:53:55,772 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 23:53:55,773 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:53:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 23:53:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-01-29 23:53:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-29 23:53:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-01-29 23:53:55,782 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 223 [2018-01-29 23:53:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:55,783 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-01-29 23:53:55,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:53:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-01-29 23:53:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-01-29 23:53:55,785 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:55,785 INFO L350 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 18, 18, 18, 18, 18, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:53:55,785 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:53:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1862485502, now seen corresponding path program 2 times [2018-01-29 23:53:55,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:55,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:55,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:55,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2018-01-29 23:53:55,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:55,995 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:53:56,001 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:56,017 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:56,044 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:56,048 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:56,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 728 proven. 147 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-01-29 23:53:56,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:56,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 23 [2018-01-29 23:53:56,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:53:56,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:53:56,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:53:56,264 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 23 states. [2018-01-29 23:53:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:56,548 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2018-01-29 23:53:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:53:56,549 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 257 [2018-01-29 23:53:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:56,549 INFO L225 Difference]: With dead ends: 263 [2018-01-29 23:53:56,549 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 23:53:56,550 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:53:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 23:53:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 23:53:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 23:53:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 23:53:56,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2018-01-29 23:53:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:56,551 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 23:53:56,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:53:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 23:53:56,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 23:53:56,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 23:53:57,351 WARN L146 SmtUtils]: Spent 602ms on a formula simplification. DAG size of input: 39 DAG size of output 28 [2018-01-29 23:53:57,535 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 44 DAG size of output 29 [2018-01-29 23:53:57,784 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 74 DAG size of output 36 [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse1 (= 1 (select |#valid| foo_~b.base))) (.cse0 (= (select |#length| foo_~b.base) 32)) (.cse2 (= foo_~b.offset 0))) (or (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and .cse0 (= foo_~size 32) .cse1 .cse2 (= foo_~i~1 0)) (not (= 0 |foo_#in~b.offset|)) (and (and .cse1 .cse0 (<= |foo_#in~size| foo_~size) (<= foo_~size 32) (<= 1 foo_~i~1)) .cse2) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:57,854 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-29 23:53:57,855 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-29 23:53:57,856 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse1 (= 1 (select |#valid| main_~c~3.base))) (.cse2 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse0 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 32 (select |#length| main_~c~3.base))) (.cse6 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|)) (.cse5 (= 0 main_~c~3.offset))) (or (and .cse0 (and (<= 1 main_~i~3) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and .cse1 .cse2 .cse0 (= 0 main_~i~3) .cse3 .cse6 .cse4 .cse5))) [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-29 23:53:57,857 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L395 ceAbstractionStarter]: At program point L25''''''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~3.offset) (<= 1 main_~i~3) (= 32 (select |#length| main_~c~3.base))) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-29 23:53:57,858 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,859 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-29 23:53:57,859 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-29 23:53:57,859 INFO L395 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 32 (select |#length| main_~c~3.base))) (.cse4 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (= 0 |main_~#mask~3.offset|)) (.cse6 (= 0 main_~c~3.offset))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= main_~i~3 0) .cse4 .cse5 .cse6))) [2018-01-29 23:53:57,859 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-29 23:53:57,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,869 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,886 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,886 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,887 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,887 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:53:57 BoogieIcfgContainer [2018-01-29 23:53:57,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:53:57,890 INFO L168 Benchmark]: Toolchain (without parser) took 10700.52 ms. Allocated memory was 305.1 MB in the beginning and 629.7 MB in the end (delta: 324.5 MB). Free memory was 264.0 MB in the beginning and 597.3 MB in the end (delta: -333.3 MB). Peak memory consumption was 253.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:57,892 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:53:57,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.35 ms. Allocated memory is still 305.1 MB. Free memory was 263.0 MB in the beginning and 254.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:57,892 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 305.1 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:57,893 INFO L168 Benchmark]: RCFGBuilder took 297.08 ms. Allocated memory is still 305.1 MB. Free memory was 252.9 MB in the beginning and 235.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:57,893 INFO L168 Benchmark]: TraceAbstraction took 10180.31 ms. Allocated memory was 305.1 MB in the beginning and 629.7 MB in the end (delta: 324.5 MB). Free memory was 234.9 MB in the beginning and 597.3 MB in the end (delta: -362.4 MB). Peak memory consumption was 224.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:57,895 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.35 ms. Allocated memory is still 305.1 MB. Free memory was 263.0 MB in the beginning and 254.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 305.1 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.08 ms. Allocated memory is still 305.1 MB. Free memory was 252.9 MB in the beginning and 235.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10180.31 ms. Allocated memory was 305.1 MB in the beginning and 629.7 MB in the end (delta: 324.5 MB). Free memory was 234.9 MB in the beginning and 597.3 MB in the end (delta: -362.4 MB). Peak memory consumption was 224.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 16]: 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: 21]: 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 - InvariantResult [Line: 25]: Loop Invariant [2018-01-29 23:53:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) && 1 <= i) && 32 == unknown-#length-unknown[c]) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-29 23:53:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,906 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[b] == 1) || !(32 == \old(size))) || ((((unknown-#length-unknown[b] == 32 && size == 32) && 1 == \valid[b]) && b == 0) && i == 0)) || !(0 == b)) || (((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && \old(size) <= size) && size <= 32) && 1 <= i) && b == 0)) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 29]: Loop Invariant [2018-01-29 23:53:57,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:53:57,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) || (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 10.0s OverallTime, 17 OverallIterations, 21 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 918 SDtfs, 1764 SDslu, 3987 SDs, 0 SdLazy, 2215 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 1239 SyntacticMatches, 16 SemanticMatches, 296 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 186 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 35 PreInvPairs, 66 NumberOfFragments, 281 HoareAnnotationTreeSize, 35 FomulaSimplifications, 3083 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1149 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2735 NumberOfCodeBlocks, 2501 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2705 ConstructedInterpolants, 140 QuantifiedInterpolants, 1154933 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2198 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 7269/8016 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-53-57-916.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-53-57-916.csv Received shutdown request...