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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:42:12,114 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:42:12,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:42:12,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:42:12,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:42:12,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:42:12,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:42:12,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:42:12,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:42:12,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:42:12,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:42:12,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:42:12,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:42:12,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:42:12,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:42:12,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:42:12,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:42:12,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:42:12,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:42:12,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:42:12,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:42:12,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:42:12,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:42:12,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:42:12,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:42:12,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:42:12,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:42:12,147 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:42:12,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:42:12,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:42:12,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:42:12,148 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf
[2018-02-02 10:42:12,157 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:42:12,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:42:12,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:42:12,158 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:42:12,158 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:42:12,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:42:12,159 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:42:12,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:42:12,160 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:42:12,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:42:12,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:42:12,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:42:12,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:42:12,161 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol
[2018-02-02 10:42:12,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:42:12,204 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:42:12,207 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:42:12,209 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:42:12,209 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:42:12,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c
[2018-02-02 10:42:12,300 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:42:12,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:42:12,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:42:12,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:42:12,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:42:12,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da079a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12, skipping insertion in model container
[2018-02-02 10:42:12,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,326 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:42:12,341 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:42:12,429 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:42:12,440 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:42:12,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12 WrapperNode
[2018-02-02 10:42:12,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:42:12,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:42:12,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:42:12,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:42:12,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
[2018-02-02 10:42:12,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:42:12,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:42:12,466 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:42:12,466 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:42:12,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:42:12,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:42:12,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:42:12,505 INFO L136 BoogieDeclarations]: Found implementation of procedure foo
[2018-02-02 10:42:12,505 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure foo
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:42:12,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:42:12,664 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:42:12,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:12 BoogieIcfgContainer
[2018-02-02 10:42:12,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:42:12,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:42:12,665 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:42:12,667 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:42:12,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:42:12" (1/3) ...
[2018-02-02 10:42:12,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd9f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:12, skipping insertion in model container
[2018-02-02 10:42:12,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:12" (2/3) ...
[2018-02-02 10:42:12,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd9f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:12, skipping insertion in model container
[2018-02-02 10:42:12,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:12" (3/3) ...
[2018-02-02 10:42:12,669 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c
[2018-02-02 10:42:12,675 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:42:12,678 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations.
[2018-02-02 10:42:12,704 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:42:12,705 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:42:12,705 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:42:12,705 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:42:12,705 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:42:12,705 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:42:12,705 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:42:12,705 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:42:12,706 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:42:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states.
[2018-02-02 10:42:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-02-02 10:42:12,725 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:12,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:12,726 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times
[2018-02-02 10:42:12,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:12,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:12,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:12,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:42:12,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:12,877 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)]
[2018-02-02 10:42:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:12,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:42:12,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:42:12,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:42:12,891 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states.
[2018-02-02 10:42:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:12,961 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions.
[2018-02-02 10:42:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:42:12,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2018-02-02 10:42:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:12,969 INFO L225 Difference]: With dead ends: 63
[2018-02-02 10:42:12,969 INFO L226 Difference]: Without dead ends: 59
[2018-02-02 10:42:12,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:42:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-02 10:42:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49.
[2018-02-02 10:42:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-02-02 10:42:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions.
[2018-02-02 10:42:13,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11
[2018-02-02 10:42:13,039 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,039 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions.
[2018-02-02 10:42:13,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:42:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions.
[2018-02-02 10:42:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 10:42:13,040 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,040 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times
[2018-02-02 10:42:13,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:13,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:42:13,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,080 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)]
[2018-02-02 10:42:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:42:13,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:42:13,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:42:13,081 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states.
[2018-02-02 10:42:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,118 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions.
[2018-02-02 10:42:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:42:13,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-02-02 10:42:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,121 INFO L225 Difference]: With dead ends: 60
[2018-02-02 10:42:13,121 INFO L226 Difference]: Without dead ends: 60
[2018-02-02 10:42:13,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:42:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-02-02 10:42:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52.
[2018-02-02 10:42:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-02-02 10:42:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions.
[2018-02-02 10:42:13,127 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16
[2018-02-02 10:42:13,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,127 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions.
[2018-02-02 10:42:13,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:42:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions.
[2018-02-02 10:42:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:42:13,128 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,128 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times
[2018-02-02 10:42:13,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:13,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:42:13,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,243 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))]
[2018-02-02 10:42:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:42:13,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:42:13,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:13,244 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states.
[2018-02-02 10:42:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,329 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions.
[2018-02-02 10:42:13,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:42:13,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2018-02-02 10:42:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,331 INFO L225 Difference]: With dead ends: 54
[2018-02-02 10:42:13,331 INFO L226 Difference]: Without dead ends: 54
[2018-02-02 10:42:13,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:42:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-02-02 10:42:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51.
[2018-02-02 10:42:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-02 10:42:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions.
[2018-02-02 10:42:13,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17
[2018-02-02 10:42:13,336 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,336 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions.
[2018-02-02 10:42:13,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:42:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions.
[2018-02-02 10:42:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:42:13,337 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,337 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times
[2018-02-02 10:42:13,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:13,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:42:13,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,376 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))]
[2018-02-02 10:42:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:42:13,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:42:13,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:13,377 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states.
[2018-02-02 10:42:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,413 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions.
[2018-02-02 10:42:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:42:13,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-02-02 10:42:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,414 INFO L225 Difference]: With dead ends: 50
[2018-02-02 10:42:13,414 INFO L226 Difference]: Without dead ends: 50
[2018-02-02 10:42:13,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-02-02 10:42:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2018-02-02 10:42:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 10:42:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions.
[2018-02-02 10:42:13,418 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17
[2018-02-02 10:42:13,419 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,419 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions.
[2018-02-02 10:42:13,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:42:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions.
[2018-02-02 10:42:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 10:42:13,420 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,420 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,420 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times
[2018-02-02 10:42:13,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:13,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:42:13,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,487 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= 32 |foo_#in~size|), 504#(= foo_~size 32), 505#(and (<= 0 foo_~i~0) (= foo_~size 32)), 506#(and (<= 1 foo_~i~0) (= foo_~size 32)), 507#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))]
[2018-02-02 10:42:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:42:13,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:42:13,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:42:13,488 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states.
[2018-02-02 10:42:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,549 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions.
[2018-02-02 10:42:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:42:13,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2018-02-02 10:42:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,550 INFO L225 Difference]: With dead ends: 52
[2018-02-02 10:42:13,551 INFO L226 Difference]: Without dead ends: 52
[2018-02-02 10:42:13,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:42:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-02-02 10:42:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46.
[2018-02-02 10:42:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2018-02-02 10:42:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions.
[2018-02-02 10:42:13,554 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 22
[2018-02-02 10:42:13,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,554 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions.
[2018-02-02 10:42:13,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:42:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions.
[2018-02-02 10:42:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 10:42:13,555 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,555 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,555 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times
[2018-02-02 10:42:13,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:13,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:42:13,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,587 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(<= 0 main_~i~1), 615#(<= 1 main_~i~1), 616#(and (<= main_~i~1 31) (<= 1 main_~i~1))]
[2018-02-02 10:42:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:42:13,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:42:13,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:13,588 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states.
[2018-02-02 10:42:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,616 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions.
[2018-02-02 10:42:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:42:13,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2018-02-02 10:42:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,617 INFO L225 Difference]: With dead ends: 56
[2018-02-02 10:42:13,617 INFO L226 Difference]: Without dead ends: 56
[2018-02-02 10:42:13,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-02-02 10:42:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42.
[2018-02-02 10:42:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2018-02-02 10:42:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions.
[2018-02-02 10:42:13,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23
[2018-02-02 10:42:13,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,621 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions.
[2018-02-02 10:42:13,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:42:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions.
[2018-02-02 10:42:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-02 10:42:13,622 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,622 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,622 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times
[2018-02-02 10:42:13,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:42:13,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:42:13,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,672 INFO L182 omatonBuilderFactory]: Interpolants [715#true, 716#false, 717#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 718#(and (= foo_~i~0 0) (not (= |foo_#in~size| 32))), 719#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:42:13,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:42:13,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:13,672 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states.
[2018-02-02 10:42:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,702 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions.
[2018-02-02 10:42:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:42:13,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31
[2018-02-02 10:42:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,703 INFO L225 Difference]: With dead ends: 51
[2018-02-02 10:42:13,703 INFO L226 Difference]: Without dead ends: 48
[2018-02-02 10:42:13,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-02-02 10:42:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44.
[2018-02-02 10:42:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2018-02-02 10:42:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions.
[2018-02-02 10:42:13,705 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31
[2018-02-02 10:42:13,705 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,705 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions.
[2018-02-02 10:42:13,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:42:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions.
[2018-02-02 10:42:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-02 10:42:13,706 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,706 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,706 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times
[2018-02-02 10:42:13,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:42:13,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:13,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4
[2018-02-02 10:42:13,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:42:13,747 INFO L182 omatonBuilderFactory]: Interpolants [817#true, 818#false, 819#(= main_~i~1 0), 820#(<= main_~i~1 1)]
[2018-02-02 10:42:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:42:13,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:42:13,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:42:13,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:42:13,747 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states.
[2018-02-02 10:42:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,783 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions.
[2018-02-02 10:42:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:42:13,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37
[2018-02-02 10:42:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,784 INFO L225 Difference]: With dead ends: 72
[2018-02-02 10:42:13,784 INFO L226 Difference]: Without dead ends: 72
[2018-02-02 10:42:13,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:42:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-02-02 10:42:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55.
[2018-02-02 10:42:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-02 10:42:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions.
[2018-02-02 10:42:13,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 37
[2018-02-02 10:42:13,786 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,786 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions.
[2018-02-02 10:42:13,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:42:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions.
[2018-02-02 10:42:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:42:13,788 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,788 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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]
[2018-02-02 10:42:13,788 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1953764441, now seen corresponding path program 2 times
[2018-02-02 10:42:13,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:42:13,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:13,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:42:13,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-02-02 10:42:13,878 INFO L182 omatonBuilderFactory]: Interpolants [948#true, 949#false, 950#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 951#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 952#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:42:13,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:42:13,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:42:13,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:13,879 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states.
[2018-02-02 10:42:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:13,932 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions.
[2018-02-02 10:42:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:42:13,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55
[2018-02-02 10:42:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:13,940 INFO L225 Difference]: With dead ends: 68
[2018-02-02 10:42:13,940 INFO L226 Difference]: Without dead ends: 65
[2018-02-02 10:42:13,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-02-02 10:42:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61.
[2018-02-02 10:42:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-02-02 10:42:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions.
[2018-02-02 10:42:13,944 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55
[2018-02-02 10:42:13,944 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:13,944 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions.
[2018-02-02 10:42:13,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:42:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions.
[2018-02-02 10:42:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-02 10:42:13,945 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:13,946 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:13,946 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 3 times
[2018-02-02 10:42:13,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:13,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-02-02 10:42:14,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:14,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:42:14,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:42:14,040 INFO L182 omatonBuilderFactory]: Interpolants [1088#(<= main_~i~1 2), 1084#true, 1085#false, 1086#(= main_~i~1 0), 1087#(<= main_~i~1 1)]
[2018-02-02 10:42:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-02-02 10:42:14,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:42:14,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:42:14,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:14,041 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states.
[2018-02-02 10:42:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:14,100 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions.
[2018-02-02 10:42:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:42:14,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67
[2018-02-02 10:42:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:14,101 INFO L225 Difference]: With dead ends: 94
[2018-02-02 10:42:14,101 INFO L226 Difference]: Without dead ends: 94
[2018-02-02 10:42:14,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:42:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2018-02-02 10:42:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72.
[2018-02-02 10:42:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2018-02-02 10:42:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions.
[2018-02-02 10:42:14,106 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 67
[2018-02-02 10:42:14,106 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:14,106 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions.
[2018-02-02 10:42:14,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:42:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions.
[2018-02-02 10:42:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2018-02-02 10:42:14,107 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:14,107 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:14,107 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash -33793592, now seen corresponding path program 4 times
[2018-02-02 10:42:14,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:14,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2018-02-02 10:42:14,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:14,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:42:14,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2018-02-02 10:42:14,232 INFO L182 omatonBuilderFactory]: Interpolants [1255#true, 1256#false, 1257#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1258#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1259#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1260#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2018-02-02 10:42:14,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:42:14,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:42:14,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:14,233 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states.
[2018-02-02 10:42:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:14,280 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions.
[2018-02-02 10:42:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:42:14,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91
[2018-02-02 10:42:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:14,282 INFO L225 Difference]: With dead ends: 85
[2018-02-02 10:42:14,282 INFO L226 Difference]: Without dead ends: 82
[2018-02-02 10:42:14,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:42:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 10:42:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78.
[2018-02-02 10:42:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-02-02 10:42:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions.
[2018-02-02 10:42:14,285 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 91
[2018-02-02 10:42:14,286 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:14,286 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions.
[2018-02-02 10:42:14,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:42:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions.
[2018-02-02 10:42:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2018-02-02 10:42:14,287 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:14,288 INFO L351 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:14,288 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash -913746080, now seen corresponding path program 5 times
[2018-02-02 10:42:14,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:14,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2018-02-02 10:42:14,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:14,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:42:14,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-02-02 10:42:14,365 INFO L182 omatonBuilderFactory]: Interpolants [1426#true, 1427#false, 1428#(= main_~i~1 0), 1429#(<= main_~i~1 1), 1430#(<= main_~i~1 2), 1431#(<= main_~i~1 3)]
[2018-02-02 10:42:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2018-02-02 10:42:14,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:42:14,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:42:14,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:14,367 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states.
[2018-02-02 10:42:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:14,436 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions.
[2018-02-02 10:42:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:42:14,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109
[2018-02-02 10:42:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:14,438 INFO L225 Difference]: With dead ends: 116
[2018-02-02 10:42:14,438 INFO L226 Difference]: Without dead ends: 116
[2018-02-02 10:42:14,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:42:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2018-02-02 10:42:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89.
[2018-02-02 10:42:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-02 10:42:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions.
[2018-02-02 10:42:14,443 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 109
[2018-02-02 10:42:14,443 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:14,443 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions.
[2018-02-02 10:42:14,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:42:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions.
[2018-02-02 10:42:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2018-02-02 10:42:14,445 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:14,445 INFO L351 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:14,445 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 969284025, now seen corresponding path program 6 times
[2018-02-02 10:42:14,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:14,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked.
[2018-02-02 10:42:14,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:14,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:42:14,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2018-02-02 10:42:14,617 INFO L182 omatonBuilderFactory]: Interpolants [1637#true, 1638#false, 1639#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1640#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1641#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1642#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1643#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked.
[2018-02-02 10:42:14,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:42:14,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:42:14,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:42:14,618 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states.
[2018-02-02 10:42:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:14,671 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions.
[2018-02-02 10:42:14,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:42:14,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139
[2018-02-02 10:42:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:14,673 INFO L225 Difference]: With dead ends: 102
[2018-02-02 10:42:14,673 INFO L226 Difference]: Without dead ends: 99
[2018-02-02 10:42:14,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:42:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2018-02-02 10:42:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95.
[2018-02-02 10:42:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2018-02-02 10:42:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions.
[2018-02-02 10:42:14,678 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 139
[2018-02-02 10:42:14,678 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:14,678 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions.
[2018-02-02 10:42:14,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:42:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions.
[2018-02-02 10:42:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2018-02-02 10:42:14,681 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:14,681 INFO L351 BasicCegarLoop]: trace histogram [20, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:14,681 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1862037927, now seen corresponding path program 7 times
[2018-02-02 10:42:14,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:14,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked.
[2018-02-02 10:42:14,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:14,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:42:14,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2018-02-02 10:42:14,767 INFO L182 omatonBuilderFactory]: Interpolants [1843#true, 1844#false, 1845#(= main_~i~1 0), 1846#(<= main_~i~1 1), 1847#(<= main_~i~1 2), 1848#(<= main_~i~1 3), 1849#(<= main_~i~1 4)]
[2018-02-02 10:42:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked.
[2018-02-02 10:42:14,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:42:14,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:42:14,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:42:14,767 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 7 states.
[2018-02-02 10:42:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:14,820 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions.
[2018-02-02 10:42:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:42:14,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163
[2018-02-02 10:42:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:14,821 INFO L225 Difference]: With dead ends: 138
[2018-02-02 10:42:14,821 INFO L226 Difference]: Without dead ends: 138
[2018-02-02 10:42:14,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:42:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2018-02-02 10:42:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106.
[2018-02-02 10:42:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states.
[2018-02-02 10:42:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions.
[2018-02-02 10:42:14,825 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 163
[2018-02-02 10:42:14,826 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:14,826 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions.
[2018-02-02 10:42:14,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:42:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions.
[2018-02-02 10:42:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200
[2018-02-02 10:42:14,829 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:14,829 INFO L351 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:14,829 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1319247558, now seen corresponding path program 8 times
[2018-02-02 10:42:14,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:14,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked.
[2018-02-02 10:42:15,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:15,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:42:15,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2018-02-02 10:42:15,040 INFO L182 omatonBuilderFactory]: Interpolants [2096#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2097#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2098#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2099#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2100#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2101#(not (= |foo_#in~size| 32)), 2094#true, 2095#false]
[2018-02-02 10:42:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked.
[2018-02-02 10:42:15,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:42:15,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:42:15,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:42:15,042 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 8 states.
[2018-02-02 10:42:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:15,103 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions.
[2018-02-02 10:42:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:42:15,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199
[2018-02-02 10:42:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:15,104 INFO L225 Difference]: With dead ends: 119
[2018-02-02 10:42:15,105 INFO L226 Difference]: Without dead ends: 116
[2018-02-02 10:42:15,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:42:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2018-02-02 10:42:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112.
[2018-02-02 10:42:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-02 10:42:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions.
[2018-02-02 10:42:15,111 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 199
[2018-02-02 10:42:15,112 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:15,112 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions.
[2018-02-02 10:42:15,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:42:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions.
[2018-02-02 10:42:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2018-02-02 10:42:15,115 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:15,115 INFO L351 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:15,115 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 125993506, now seen corresponding path program 9 times
[2018-02-02 10:42:15,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:15,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked.
[2018-02-02 10:42:15,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:15,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:42:15,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked.
[2018-02-02 10:42:15,254 INFO L182 omatonBuilderFactory]: Interpolants [2336#false, 2337#(= main_~i~1 0), 2338#(<= main_~i~1 1), 2339#(<= main_~i~1 2), 2340#(<= main_~i~1 3), 2341#(<= main_~i~1 4), 2342#(<= main_~i~1 5), 2335#true]
[2018-02-02 10:42:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked.
[2018-02-02 10:42:15,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:42:15,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:42:15,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:42:15,255 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 8 states.
[2018-02-02 10:42:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:15,334 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions.
[2018-02-02 10:42:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:42:15,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229
[2018-02-02 10:42:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:15,336 INFO L225 Difference]: With dead ends: 160
[2018-02-02 10:42:15,336 INFO L226 Difference]: Without dead ends: 160
[2018-02-02 10:42:15,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:42:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2018-02-02 10:42:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123.
[2018-02-02 10:42:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states.
[2018-02-02 10:42:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions.
[2018-02-02 10:42:15,341 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 229
[2018-02-02 10:42:15,341 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:15,341 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions.
[2018-02-02 10:42:15,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:42:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions.
[2018-02-02 10:42:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2018-02-02 10:42:15,345 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:15,345 INFO L351 BasicCegarLoop]: trace histogram [36, 30, 30, 30, 30, 30, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:15,345 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2046000651, now seen corresponding path program 10 times
[2018-02-02 10:42:15,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:15,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked.
[2018-02-02 10:42:15,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:15,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:42:15,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked.
[2018-02-02 10:42:15,596 INFO L182 omatonBuilderFactory]: Interpolants [2626#true, 2627#false, 2628#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2629#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2630#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2631#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2632#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2633#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2634#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked.
[2018-02-02 10:42:15,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:42:15,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:42:15,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:42:15,597 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 9 states.
[2018-02-02 10:42:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:15,643 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions.
[2018-02-02 10:42:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:42:15,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271
[2018-02-02 10:42:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:15,644 INFO L225 Difference]: With dead ends: 136
[2018-02-02 10:42:15,644 INFO L226 Difference]: Without dead ends: 133
[2018-02-02 10:42:15,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:42:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2018-02-02 10:42:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129.
[2018-02-02 10:42:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-02-02 10:42:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions.
[2018-02-02 10:42:15,647 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 271
[2018-02-02 10:42:15,647 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:15,647 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions.
[2018-02-02 10:42:15,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:42:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions.
[2018-02-02 10:42:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2018-02-02 10:42:15,650 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:15,650 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 36, 36, 36, 36, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:15,650 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash -416957317, now seen corresponding path program 11 times
[2018-02-02 10:42:15,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:15,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked.
[2018-02-02 10:42:15,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:15,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:42:15,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2018-02-02 10:42:15,861 INFO L182 omatonBuilderFactory]: Interpolants [2902#true, 2903#false, 2904#(= main_~i~1 0), 2905#(<= main_~i~1 1), 2906#(<= main_~i~1 2), 2907#(<= main_~i~1 3), 2908#(<= main_~i~1 4), 2909#(<= main_~i~1 5), 2910#(<= main_~i~1 6)]
[2018-02-02 10:42:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked.
[2018-02-02 10:42:15,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:42:15,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:42:15,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:42:15,863 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 9 states.
[2018-02-02 10:42:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:15,945 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions.
[2018-02-02 10:42:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:42:15,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307
[2018-02-02 10:42:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:15,946 INFO L225 Difference]: With dead ends: 182
[2018-02-02 10:42:15,946 INFO L226 Difference]: Without dead ends: 182
[2018-02-02 10:42:15,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:42:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2018-02-02 10:42:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140.
[2018-02-02 10:42:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states.
[2018-02-02 10:42:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions.
[2018-02-02 10:42:15,949 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 307
[2018-02-02 10:42:15,949 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:15,949 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions.
[2018-02-02 10:42:15,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:42:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions.
[2018-02-02 10:42:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356
[2018-02-02 10:42:15,950 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:15,950 INFO L351 BasicCegarLoop]: trace histogram [49, 42, 42, 42, 42, 42, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:15,950 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1766255124, now seen corresponding path program 12 times
[2018-02-02 10:42:15,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:15,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked.
[2018-02-02 10:42:16,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:16,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:42:16,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked.
[2018-02-02 10:42:16,247 INFO L182 omatonBuilderFactory]: Interpolants [3233#true, 3234#false, 3235#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3236#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3237#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3238#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3239#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3240#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3241#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3242#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked.
[2018-02-02 10:42:16,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:42:16,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:42:16,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:42:16,249 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand 10 states.
[2018-02-02 10:42:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:16,319 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions.
[2018-02-02 10:42:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:42:16,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 355
[2018-02-02 10:42:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:16,324 INFO L225 Difference]: With dead ends: 153
[2018-02-02 10:42:16,324 INFO L226 Difference]: Without dead ends: 150
[2018-02-02 10:42:16,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:42:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-02-02 10:42:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146.
[2018-02-02 10:42:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-02-02 10:42:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions.
[2018-02-02 10:42:16,327 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 355
[2018-02-02 10:42:16,327 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:16,327 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions.
[2018-02-02 10:42:16,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:42:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions.
[2018-02-02 10:42:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398
[2018-02-02 10:42:16,329 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:16,329 INFO L351 BasicCegarLoop]: trace histogram [56, 49, 49, 49, 49, 49, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:16,329 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1901043492, now seen corresponding path program 13 times
[2018-02-02 10:42:16,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:16,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked.
[2018-02-02 10:42:16,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:16,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:42:16,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked.
[2018-02-02 10:42:16,574 INFO L182 omatonBuilderFactory]: Interpolants [3552#(<= main_~i~1 6), 3553#(<= main_~i~1 7), 3544#true, 3545#false, 3546#(= main_~i~1 0), 3547#(<= main_~i~1 1), 3548#(<= main_~i~1 2), 3549#(<= main_~i~1 3), 3550#(<= main_~i~1 4), 3551#(<= main_~i~1 5)]
[2018-02-02 10:42:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked.
[2018-02-02 10:42:16,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:42:16,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:42:16,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:42:16,576 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 10 states.
[2018-02-02 10:42:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:16,695 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions.
[2018-02-02 10:42:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:42:16,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 397
[2018-02-02 10:42:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:16,697 INFO L225 Difference]: With dead ends: 204
[2018-02-02 10:42:16,697 INFO L226 Difference]: Without dead ends: 204
[2018-02-02 10:42:16,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:42:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2018-02-02 10:42:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157.
[2018-02-02 10:42:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2018-02-02 10:42:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions.
[2018-02-02 10:42:16,701 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 397
[2018-02-02 10:42:16,701 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:16,701 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions.
[2018-02-02 10:42:16,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:42:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions.
[2018-02-02 10:42:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452
[2018-02-02 10:42:16,703 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:16,704 INFO L351 BasicCegarLoop]: trace histogram [64, 56, 56, 56, 56, 56, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:16,704 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 319186589, now seen corresponding path program 14 times
[2018-02-02 10:42:16,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:16,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked.
[2018-02-02 10:42:17,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:17,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-02 10:42:17,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked.
[2018-02-02 10:42:17,229 INFO L182 omatonBuilderFactory]: Interpolants [3920#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3921#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3922#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3923#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3924#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3925#(not (= |foo_#in~size| 32)), 3915#true, 3916#false, 3917#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3918#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3919#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))]
[2018-02-02 10:42:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked.
[2018-02-02 10:42:17,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:42:17,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:42:17,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:42:17,230 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states.
[2018-02-02 10:42:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:17,297 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions.
[2018-02-02 10:42:17,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:42:17,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 451
[2018-02-02 10:42:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:17,298 INFO L225 Difference]: With dead ends: 170
[2018-02-02 10:42:17,299 INFO L226 Difference]: Without dead ends: 167
[2018-02-02 10:42:17,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:42:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2018-02-02 10:42:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163.
[2018-02-02 10:42:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states.
[2018-02-02 10:42:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions.
[2018-02-02 10:42:17,302 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 451
[2018-02-02 10:42:17,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:17,302 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions.
[2018-02-02 10:42:17,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:42:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions.
[2018-02-02 10:42:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500
[2018-02-02 10:42:17,304 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:17,304 INFO L351 BasicCegarLoop]: trace histogram [72, 64, 64, 64, 64, 64, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:17,304 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash -702635043, now seen corresponding path program 15 times
[2018-02-02 10:42:17,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:17,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked.
[2018-02-02 10:42:17,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:17,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-02 10:42:17,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2018-02-02 10:42:17,597 INFO L182 omatonBuilderFactory]: Interpolants [4261#true, 4262#false, 4263#(= main_~i~1 0), 4264#(<= main_~i~1 1), 4265#(<= main_~i~1 2), 4266#(<= main_~i~1 3), 4267#(<= main_~i~1 4), 4268#(<= main_~i~1 5), 4269#(<= main_~i~1 6), 4270#(<= main_~i~1 7), 4271#(<= main_~i~1 8)]
[2018-02-02 10:42:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked.
[2018-02-02 10:42:17,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:42:17,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:42:17,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:42:17,599 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 11 states.
[2018-02-02 10:42:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:17,794 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions.
[2018-02-02 10:42:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:42:17,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 499
[2018-02-02 10:42:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:17,797 INFO L225 Difference]: With dead ends: 226
[2018-02-02 10:42:17,797 INFO L226 Difference]: Without dead ends: 226
[2018-02-02 10:42:17,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:42:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-02-02 10:42:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174.
[2018-02-02 10:42:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states.
[2018-02-02 10:42:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions.
[2018-02-02 10:42:17,804 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 499
[2018-02-02 10:42:17,804 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:17,804 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions.
[2018-02-02 10:42:17,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:42:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions.
[2018-02-02 10:42:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560
[2018-02-02 10:42:17,808 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:17,808 INFO L351 BasicCegarLoop]: trace histogram [81, 72, 72, 72, 72, 72, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:17,808 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1002440158, now seen corresponding path program 16 times
[2018-02-02 10:42:17,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:17,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked.
[2018-02-02 10:42:18,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:18,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:42:18,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked.
[2018-02-02 10:42:18,425 INFO L182 omatonBuilderFactory]: Interpolants [4672#true, 4673#false, 4674#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4675#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4676#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4677#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4678#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4679#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4680#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4681#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4682#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 4683#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked.
[2018-02-02 10:42:18,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:42:18,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:42:18,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:42:18,427 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 12 states.
[2018-02-02 10:42:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:18,532 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions.
[2018-02-02 10:42:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 10:42:18,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 559
[2018-02-02 10:42:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:18,533 INFO L225 Difference]: With dead ends: 187
[2018-02-02 10:42:18,533 INFO L226 Difference]: Without dead ends: 184
[2018-02-02 10:42:18,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:42:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2018-02-02 10:42:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180.
[2018-02-02 10:42:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states.
[2018-02-02 10:42:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions.
[2018-02-02 10:42:18,538 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 559
[2018-02-02 10:42:18,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:18,539 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions.
[2018-02-02 10:42:18,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:42:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions.
[2018-02-02 10:42:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614
[2018-02-02 10:42:18,543 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:18,543 INFO L351 BasicCegarLoop]: trace histogram [90, 81, 81, 81, 81, 81, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:18,543 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash -978150298, now seen corresponding path program 17 times
[2018-02-02 10:42:18,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:18,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked.
[2018-02-02 10:42:19,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:19,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:42:19,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked.
[2018-02-02 10:42:19,040 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= main_~i~1 1), 5057#(<= main_~i~1 2), 5058#(<= main_~i~1 3), 5059#(<= main_~i~1 4), 5060#(<= main_~i~1 5), 5061#(<= main_~i~1 6), 5062#(<= main_~i~1 7), 5063#(<= main_~i~1 8), 5064#(<= main_~i~1 9), 5053#true, 5054#false, 5055#(= main_~i~1 0)]
[2018-02-02 10:42:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked.
[2018-02-02 10:42:19,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:42:19,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:42:19,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:42:19,041 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 12 states.
[2018-02-02 10:42:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:19,261 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions.
[2018-02-02 10:42:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 10:42:19,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 613
[2018-02-02 10:42:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:19,263 INFO L225 Difference]: With dead ends: 248
[2018-02-02 10:42:19,263 INFO L226 Difference]: Without dead ends: 248
[2018-02-02 10:42:19,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:42:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2018-02-02 10:42:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191.
[2018-02-02 10:42:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states.
[2018-02-02 10:42:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions.
[2018-02-02 10:42:19,267 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 613
[2018-02-02 10:42:19,268 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:19,268 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions.
[2018-02-02 10:42:19,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:42:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions.
[2018-02-02 10:42:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680
[2018-02-02 10:42:19,271 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:19,271 INFO L351 BasicCegarLoop]: trace histogram [100, 90, 90, 90, 90, 90, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:19,271 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 711631215, now seen corresponding path program 18 times
[2018-02-02 10:42:19,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:19,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked.
[2018-02-02 10:42:20,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:20,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:42:20,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 531 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked.
[2018-02-02 10:42:20,097 INFO L182 omatonBuilderFactory]: Interpolants [5504#true, 5505#false, 5506#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5507#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5508#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5509#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5510#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5511#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5512#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5513#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5514#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 5515#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5516#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked.
[2018-02-02 10:42:20,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:42:20,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:42:20,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:42:20,099 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states.
[2018-02-02 10:42:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:20,199 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions.
[2018-02-02 10:42:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 10:42:20,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 679
[2018-02-02 10:42:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:20,204 INFO L225 Difference]: With dead ends: 204
[2018-02-02 10:42:20,204 INFO L226 Difference]: Without dead ends: 201
[2018-02-02 10:42:20,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:42:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2018-02-02 10:42:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197.
[2018-02-02 10:42:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states.
[2018-02-02 10:42:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions.
[2018-02-02 10:42:20,210 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 679
[2018-02-02 10:42:20,210 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:20,210 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions.
[2018-02-02 10:42:20,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:42:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions.
[2018-02-02 10:42:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740
[2018-02-02 10:42:20,215 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:20,216 INFO L351 BasicCegarLoop]: trace histogram [110, 100, 100, 100, 100, 100, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:20,216 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:20,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1834618241, now seen corresponding path program 19 times
[2018-02-02 10:42:20,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:20,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked.
[2018-02-02 10:42:20,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:20,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:42:20,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked.
[2018-02-02 10:42:20,743 INFO L182 omatonBuilderFactory]: Interpolants [5920#true, 5921#false, 5922#(= main_~i~1 0), 5923#(<= main_~i~1 1), 5924#(<= main_~i~1 2), 5925#(<= main_~i~1 3), 5926#(<= main_~i~1 4), 5927#(<= main_~i~1 5), 5928#(<= main_~i~1 6), 5929#(<= main_~i~1 7), 5930#(<= main_~i~1 8), 5931#(<= main_~i~1 9), 5932#(<= main_~i~1 10)]
[2018-02-02 10:42:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked.
[2018-02-02 10:42:20,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:42:20,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:42:20,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:42:20,744 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 13 states.
[2018-02-02 10:42:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:20,855 INFO L93 Difference]: Finished difference Result 270 states and 284 transitions.
[2018-02-02 10:42:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 10:42:20,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 739
[2018-02-02 10:42:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:20,857 INFO L225 Difference]: With dead ends: 270
[2018-02-02 10:42:20,857 INFO L226 Difference]: Without dead ends: 270
[2018-02-02 10:42:20,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:42:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states.
[2018-02-02 10:42:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 208.
[2018-02-02 10:42:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states.
[2018-02-02 10:42:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions.
[2018-02-02 10:42:20,863 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 739
[2018-02-02 10:42:20,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:20,864 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions.
[2018-02-02 10:42:20,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:42:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions.
[2018-02-02 10:42:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812
[2018-02-02 10:42:20,870 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:20,870 INFO L351 BasicCegarLoop]: trace histogram [121, 110, 110, 110, 110, 110, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:20,870 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2041430256, now seen corresponding path program 20 times
[2018-02-02 10:42:20,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:20,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked.
[2018-02-02 10:42:21,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:21,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:42:21,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 2980 trivial. 0 not checked.
[2018-02-02 10:42:21,944 INFO L182 omatonBuilderFactory]: Interpolants [6411#true, 6412#false, 6413#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6414#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6415#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6416#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6417#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6418#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6419#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6420#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6421#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 6422#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6423#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6424#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked.
[2018-02-02 10:42:21,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:42:21,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:42:21,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:42:21,946 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 14 states.
[2018-02-02 10:42:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:22,036 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions.
[2018-02-02 10:42:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:42:22,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 811
[2018-02-02 10:42:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:22,038 INFO L225 Difference]: With dead ends: 221
[2018-02-02 10:42:22,038 INFO L226 Difference]: Without dead ends: 218
[2018-02-02 10:42:22,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:42:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2018-02-02 10:42:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214.
[2018-02-02 10:42:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states.
[2018-02-02 10:42:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions.
[2018-02-02 10:42:22,047 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 811
[2018-02-02 10:42:22,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:22,047 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions.
[2018-02-02 10:42:22,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:42:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions.
[2018-02-02 10:42:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878
[2018-02-02 10:42:22,054 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:22,054 INFO L351 BasicCegarLoop]: trace histogram [132, 121, 121, 121, 121, 121, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:22,054 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1088231448, now seen corresponding path program 21 times
[2018-02-02 10:42:22,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:22,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked.
[2018-02-02 10:42:22,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:22,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:42:22,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked.
[2018-02-02 10:42:22,806 INFO L182 omatonBuilderFactory]: Interpolants [6862#true, 6863#false, 6864#(= main_~i~1 0), 6865#(<= main_~i~1 1), 6866#(<= main_~i~1 2), 6867#(<= main_~i~1 3), 6868#(<= main_~i~1 4), 6869#(<= main_~i~1 5), 6870#(<= main_~i~1 6), 6871#(<= main_~i~1 7), 6872#(<= main_~i~1 8), 6873#(<= main_~i~1 9), 6874#(<= main_~i~1 10), 6875#(<= main_~i~1 11)]
[2018-02-02 10:42:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked.
[2018-02-02 10:42:22,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:42:22,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:42:22,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:42:22,807 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 14 states.
[2018-02-02 10:42:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:22,962 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions.
[2018-02-02 10:42:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:42:22,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 877
[2018-02-02 10:42:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:22,963 INFO L225 Difference]: With dead ends: 292
[2018-02-02 10:42:22,963 INFO L226 Difference]: Without dead ends: 292
[2018-02-02 10:42:22,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:42:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2018-02-02 10:42:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 225.
[2018-02-02 10:42:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states.
[2018-02-02 10:42:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions.
[2018-02-02 10:42:22,967 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 877
[2018-02-02 10:42:22,967 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:22,967 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions.
[2018-02-02 10:42:22,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:42:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions.
[2018-02-02 10:42:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956
[2018-02-02 10:42:22,972 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:22,972 INFO L351 BasicCegarLoop]: trace histogram [144, 132, 132, 132, 132, 132, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:22,972 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash -500335487, now seen corresponding path program 22 times
[2018-02-02 10:42:22,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:23,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked.
[2018-02-02 10:42:24,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:24,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:42:24,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4752 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 3971 trivial. 0 not checked.
[2018-02-02 10:42:24,155 INFO L182 omatonBuilderFactory]: Interpolants [7393#true, 7394#false, 7395#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7396#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7397#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7398#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7399#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7400#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7401#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7402#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7403#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 7404#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7405#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7406#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7407#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked.
[2018-02-02 10:42:24,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:42:24,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:42:24,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:42:24,157 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 15 states.
[2018-02-02 10:42:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:24,249 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions.
[2018-02-02 10:42:24,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:42:24,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 955
[2018-02-02 10:42:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:24,250 INFO L225 Difference]: With dead ends: 238
[2018-02-02 10:42:24,250 INFO L226 Difference]: Without dead ends: 235
[2018-02-02 10:42:24,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:42:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states.
[2018-02-02 10:42:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231.
[2018-02-02 10:42:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-02-02 10:42:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions.
[2018-02-02 10:42:24,256 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 955
[2018-02-02 10:42:24,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:24,256 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions.
[2018-02-02 10:42:24,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:42:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions.
[2018-02-02 10:42:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028
[2018-02-02 10:42:24,265 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:24,265 INFO L351 BasicCegarLoop]: trace histogram [156, 144, 144, 144, 144, 144, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:24,265 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1879255455, now seen corresponding path program 23 times
[2018-02-02 10:42:24,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:24,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked.
[2018-02-02 10:42:25,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:25,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:42:25,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5148 trivial. 0 not checked.
[2018-02-02 10:42:25,269 INFO L182 omatonBuilderFactory]: Interpolants [7879#true, 7880#false, 7881#(= main_~i~1 0), 7882#(<= main_~i~1 1), 7883#(<= main_~i~1 2), 7884#(<= main_~i~1 3), 7885#(<= main_~i~1 4), 7886#(<= main_~i~1 5), 7887#(<= main_~i~1 6), 7888#(<= main_~i~1 7), 7889#(<= main_~i~1 8), 7890#(<= main_~i~1 9), 7891#(<= main_~i~1 10), 7892#(<= main_~i~1 11), 7893#(<= main_~i~1 12)]
[2018-02-02 10:42:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked.
[2018-02-02 10:42:25,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:42:25,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:42:25,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:42:25,271 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand 15 states.
[2018-02-02 10:42:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:25,377 INFO L93 Difference]: Finished difference Result 314 states and 330 transitions.
[2018-02-02 10:42:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:42:25,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1027
[2018-02-02 10:42:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:25,379 INFO L225 Difference]: With dead ends: 314
[2018-02-02 10:42:25,379 INFO L226 Difference]: Without dead ends: 314
[2018-02-02 10:42:25,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:42:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2018-02-02 10:42:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242.
[2018-02-02 10:42:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-02-02 10:42:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions.
[2018-02-02 10:42:25,385 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 1027
[2018-02-02 10:42:25,385 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:25,386 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions.
[2018-02-02 10:42:25,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:42:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions.
[2018-02-02 10:42:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112
[2018-02-02 10:42:25,395 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:25,396 INFO L351 BasicCegarLoop]: trace histogram [169, 156, 156, 156, 156, 156, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:25,396 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1856294786, now seen corresponding path program 24 times
[2018-02-02 10:42:25,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:25,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked.
[2018-02-02 10:42:26,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:26,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:42:26,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 5160 trivial. 0 not checked.
[2018-02-02 10:42:26,876 INFO L182 omatonBuilderFactory]: Interpolants [8450#true, 8451#false, 8452#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8453#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8454#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8455#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8456#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8457#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8458#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8459#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8460#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 8461#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8462#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8463#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8464#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8465#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked.
[2018-02-02 10:42:26,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:42:26,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:42:26,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:42:26,878 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 16 states.
[2018-02-02 10:42:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:26,945 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions.
[2018-02-02 10:42:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:42:26,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1111
[2018-02-02 10:42:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:26,946 INFO L225 Difference]: With dead ends: 255
[2018-02-02 10:42:26,946 INFO L226 Difference]: Without dead ends: 252
[2018-02-02 10:42:26,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:42:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2018-02-02 10:42:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248.
[2018-02-02 10:42:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states.
[2018-02-02 10:42:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions.
[2018-02-02 10:42:26,952 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 1111
[2018-02-02 10:42:26,952 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:26,952 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions.
[2018-02-02 10:42:26,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:42:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions.
[2018-02-02 10:42:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190
[2018-02-02 10:42:26,963 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:26,964 INFO L351 BasicCegarLoop]: trace histogram [182, 169, 169, 169, 169, 169, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:26,964 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1396010922, now seen corresponding path program 25 times
[2018-02-02 10:42:26,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:27,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked.
[2018-02-02 10:42:28,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:28,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:42:28,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6552 trivial. 0 not checked.
[2018-02-02 10:42:28,373 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(= main_~i~1 0), 8974#(<= main_~i~1 1), 8975#(<= main_~i~1 2), 8976#(<= main_~i~1 3), 8977#(<= main_~i~1 4), 8978#(<= main_~i~1 5), 8979#(<= main_~i~1 6), 8980#(<= main_~i~1 7), 8981#(<= main_~i~1 8), 8982#(<= main_~i~1 9), 8983#(<= main_~i~1 10), 8984#(<= main_~i~1 11), 8985#(<= main_~i~1 12), 8986#(<= main_~i~1 13)]
[2018-02-02 10:42:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked.
[2018-02-02 10:42:28,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:42:28,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:42:28,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:42:28,376 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand 16 states.
[2018-02-02 10:42:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:28,526 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions.
[2018-02-02 10:42:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:42:28,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1189
[2018-02-02 10:42:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:28,528 INFO L225 Difference]: With dead ends: 336
[2018-02-02 10:42:28,528 INFO L226 Difference]: Without dead ends: 336
[2018-02-02 10:42:28,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:42:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-02-02 10:42:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 259.
[2018-02-02 10:42:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states.
[2018-02-02 10:42:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions.
[2018-02-02 10:42:28,531 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 1189
[2018-02-02 10:42:28,532 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:28,532 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions.
[2018-02-02 10:42:28,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:42:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions.
[2018-02-02 10:42:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280
[2018-02-02 10:42:28,541 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:28,541 INFO L351 BasicCegarLoop]: trace histogram [196, 182, 182, 182, 182, 182, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:28,541 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:28,541 INFO L82 PathProgramCache]: Analyzing trace with hash -601504301, now seen corresponding path program 26 times
[2018-02-02 10:42:28,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:28,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:30,098 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 12 DAG size of output 10
[2018-02-02 10:42:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked.
[2018-02-02 10:42:30,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:30,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:42:30,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 0 proven. 1079 refuted. 0 times theorem prover too weak. 6565 trivial. 0 not checked.
[2018-02-02 10:42:30,781 INFO L182 omatonBuilderFactory]: Interpolants [9582#true, 9583#false, 9584#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9585#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9586#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9587#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9588#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9589#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9590#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9591#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9592#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 9593#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9594#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9595#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9596#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9597#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9598#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked.
[2018-02-02 10:42:30,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:42:30,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:42:30,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:42:30,783 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 17 states.
[2018-02-02 10:42:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:30,865 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions.
[2018-02-02 10:42:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:42:30,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1279
[2018-02-02 10:42:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:30,867 INFO L225 Difference]: With dead ends: 272
[2018-02-02 10:42:30,867 INFO L226 Difference]: Without dead ends: 269
[2018-02-02 10:42:30,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:42:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states.
[2018-02-02 10:42:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265.
[2018-02-02 10:42:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states.
[2018-02-02 10:42:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 294 transitions.
[2018-02-02 10:42:30,872 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 294 transitions. Word has length 1279
[2018-02-02 10:42:30,872 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:30,872 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 294 transitions.
[2018-02-02 10:42:30,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:42:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 294 transitions.
[2018-02-02 10:42:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364
[2018-02-02 10:42:30,885 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:30,885 INFO L351 BasicCegarLoop]: trace histogram [210, 196, 196, 196, 196, 196, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:30,886 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1767243139, now seen corresponding path program 27 times
[2018-02-02 10:42:30,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:30,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked.
[2018-02-02 10:42:32,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:32,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:42:32,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked.
[2018-02-02 10:42:32,675 INFO L182 omatonBuilderFactory]: Interpolants [10144#(<= main_~i~1 4), 10145#(<= main_~i~1 5), 10146#(<= main_~i~1 6), 10147#(<= main_~i~1 7), 10148#(<= main_~i~1 8), 10149#(<= main_~i~1 9), 10150#(<= main_~i~1 10), 10151#(<= main_~i~1 11), 10152#(<= main_~i~1 12), 10153#(<= main_~i~1 13), 10154#(<= main_~i~1 14), 10138#true, 10139#false, 10140#(= main_~i~1 0), 10141#(<= main_~i~1 1), 10142#(<= main_~i~1 2), 10143#(<= main_~i~1 3)]
[2018-02-02 10:42:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked.
[2018-02-02 10:42:32,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:42:32,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:42:32,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:42:32,677 INFO L87 Difference]: Start difference. First operand 265 states and 294 transitions. Second operand 17 states.
[2018-02-02 10:42:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:32,808 INFO L93 Difference]: Finished difference Result 358 states and 376 transitions.
[2018-02-02 10:42:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:42:32,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1363
[2018-02-02 10:42:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:32,810 INFO L225 Difference]: With dead ends: 358
[2018-02-02 10:42:32,811 INFO L226 Difference]: Without dead ends: 358
[2018-02-02 10:42:32,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:42:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2018-02-02 10:42:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276.
[2018-02-02 10:42:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states.
[2018-02-02 10:42:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 307 transitions.
[2018-02-02 10:42:32,817 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 307 transitions. Word has length 1363
[2018-02-02 10:42:32,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:32,818 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 307 transitions.
[2018-02-02 10:42:32,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:42:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 307 transitions.
[2018-02-02 10:42:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460
[2018-02-02 10:42:32,833 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:32,833 INFO L351 BasicCegarLoop]: trace histogram [225, 210, 210, 210, 210, 210, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:32,833 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 946488628, now seen corresponding path program 28 times
[2018-02-02 10:42:32,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:32,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked.
[2018-02-02 10:42:35,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:35,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:42:35,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9450 backedges. 0 proven. 1246 refuted. 0 times theorem prover too weak. 8204 trivial. 0 not checked.
[2018-02-02 10:42:35,258 INFO L182 omatonBuilderFactory]: Interpolants [10789#true, 10790#false, 10791#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10792#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10793#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10794#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10795#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10796#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10797#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10798#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10799#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 10800#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10801#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10802#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10803#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10804#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10805#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10806#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked.
[2018-02-02 10:42:35,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:42:35,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:42:35,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:42:35,261 INFO L87 Difference]: Start difference. First operand 276 states and 307 transitions. Second operand 18 states.
[2018-02-02 10:42:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:35,358 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions.
[2018-02-02 10:42:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:42:35,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1459
[2018-02-02 10:42:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:35,359 INFO L225 Difference]: With dead ends: 289
[2018-02-02 10:42:35,359 INFO L226 Difference]: Without dead ends: 286
[2018-02-02 10:42:35,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:42:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states.
[2018-02-02 10:42:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282.
[2018-02-02 10:42:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states.
[2018-02-02 10:42:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions.
[2018-02-02 10:42:35,365 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 1459
[2018-02-02 10:42:35,365 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:35,365 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions.
[2018-02-02 10:42:35,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:42:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions.
[2018-02-02 10:42:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550
[2018-02-02 10:42:35,376 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:35,376 INFO L351 BasicCegarLoop]: trace histogram [240, 225, 225, 225, 225, 225, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:35,376 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -754671188, now seen corresponding path program 29 times
[2018-02-02 10:42:35,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:35,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked.
[2018-02-02 10:42:37,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:37,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:42:37,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked.
[2018-02-02 10:42:37,470 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~1 10), 11393#(<= main_~i~1 11), 11394#(<= main_~i~1 12), 11395#(<= main_~i~1 13), 11396#(<= main_~i~1 14), 11397#(<= main_~i~1 15), 11380#true, 11381#false, 11382#(= main_~i~1 0), 11383#(<= main_~i~1 1), 11384#(<= main_~i~1 2), 11385#(<= main_~i~1 3), 11386#(<= main_~i~1 4), 11387#(<= main_~i~1 5), 11388#(<= main_~i~1 6), 11389#(<= main_~i~1 7), 11390#(<= main_~i~1 8), 11391#(<= main_~i~1 9)]
[2018-02-02 10:42:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked.
[2018-02-02 10:42:37,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:42:37,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:42:37,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:42:37,472 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand 18 states.
[2018-02-02 10:42:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:37,588 INFO L93 Difference]: Finished difference Result 380 states and 399 transitions.
[2018-02-02 10:42:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:42:37,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1549
[2018-02-02 10:42:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:37,590 INFO L225 Difference]: With dead ends: 380
[2018-02-02 10:42:37,590 INFO L226 Difference]: Without dead ends: 380
[2018-02-02 10:42:37,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:42:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2018-02-02 10:42:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 293.
[2018-02-02 10:42:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states.
[2018-02-02 10:42:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 326 transitions.
[2018-02-02 10:42:37,594 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 326 transitions. Word has length 1549
[2018-02-02 10:42:37,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:37,594 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 326 transitions.
[2018-02-02 10:42:37,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:42:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 326 transitions.
[2018-02-02 10:42:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652
[2018-02-02 10:42:37,605 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:37,605 INFO L351 BasicCegarLoop]: trace histogram [256, 240, 240, 240, 240, 240, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:37,605 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1444662117, now seen corresponding path program 30 times
[2018-02-02 10:42:37,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:37,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked.
[2018-02-02 10:42:40,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:40,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:42:40,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 0 proven. 1425 refuted. 0 times theorem prover too weak. 10095 trivial. 0 not checked.
[2018-02-02 10:42:40,581 INFO L182 omatonBuilderFactory]: Interpolants [12071#true, 12072#false, 12073#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12074#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12075#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12076#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12077#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12078#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12079#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12080#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12081#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 12082#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12083#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12084#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12085#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12086#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12087#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12088#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12089#(not (= |foo_#in~size| 32))]
[2018-02-02 10:42:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked.
[2018-02-02 10:42:40,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:42:40,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:42:40,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:42:40,583 INFO L87 Difference]: Start difference. First operand 293 states and 326 transitions. Second operand 19 states.
[2018-02-02 10:42:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:40,667 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions.
[2018-02-02 10:42:40,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:42:40,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1651
[2018-02-02 10:42:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:40,668 INFO L225 Difference]: With dead ends: 306
[2018-02-02 10:42:40,668 INFO L226 Difference]: Without dead ends: 303
[2018-02-02 10:42:40,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:42:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states.
[2018-02-02 10:42:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299.
[2018-02-02 10:42:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states.
[2018-02-02 10:42:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions.
[2018-02-02 10:42:40,673 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 1651
[2018-02-02 10:42:40,673 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:40,673 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions.
[2018-02-02 10:42:40,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:42:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions.
[2018-02-02 10:42:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748
[2018-02-02 10:42:40,688 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:40,689 INFO L351 BasicCegarLoop]: trace histogram [272, 256, 256, 256, 256, 256, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:40,689 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 104699365, now seen corresponding path program 31 times
[2018-02-02 10:42:40,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:40,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked.
[2018-02-02 10:42:43,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:43,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:42:43,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12240 trivial. 0 not checked.
[2018-02-02 10:42:43,408 INFO L182 omatonBuilderFactory]: Interpolants [12704#(<= main_~i~1 5), 12705#(<= main_~i~1 6), 12706#(<= main_~i~1 7), 12707#(<= main_~i~1 8), 12708#(<= main_~i~1 9), 12709#(<= main_~i~1 10), 12710#(<= main_~i~1 11), 12711#(<= main_~i~1 12), 12712#(<= main_~i~1 13), 12713#(<= main_~i~1 14), 12714#(<= main_~i~1 15), 12715#(<= main_~i~1 16), 12697#true, 12698#false, 12699#(= main_~i~1 0), 12700#(<= main_~i~1 1), 12701#(<= main_~i~1 2), 12702#(<= main_~i~1 3), 12703#(<= main_~i~1 4)]
[2018-02-02 10:42:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked.
[2018-02-02 10:42:43,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:42:43,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:42:43,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:42:43,411 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 19 states.
[2018-02-02 10:42:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:43,539 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions.
[2018-02-02 10:42:43,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:42:43,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1747
[2018-02-02 10:42:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:43,541 INFO L225 Difference]: With dead ends: 402
[2018-02-02 10:42:43,541 INFO L226 Difference]: Without dead ends: 402
[2018-02-02 10:42:43,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:42:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states.
[2018-02-02 10:42:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 310.
[2018-02-02 10:42:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states.
[2018-02-02 10:42:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 345 transitions.
[2018-02-02 10:42:43,546 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 345 transitions. Word has length 1747
[2018-02-02 10:42:43,547 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:43,547 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 345 transitions.
[2018-02-02 10:42:43,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:42:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 345 transitions.
[2018-02-02 10:42:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1856
[2018-02-02 10:42:43,570 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:43,571 INFO L351 BasicCegarLoop]: trace histogram [289, 272, 272, 272, 272, 272, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:43,571 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash -553996762, now seen corresponding path program 32 times
[2018-02-02 10:42:43,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:43,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked.
[2018-02-02 10:42:47,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:47,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:42:47,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 1616 refuted. 0 times theorem prover too weak. 12256 trivial. 0 not checked.
[2018-02-02 10:42:47,520 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13441#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13442#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13443#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13444#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13445#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13446#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13447#(not (= |foo_#in~size| 32)), 13428#true, 13429#false, 13430#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13431#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13432#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13433#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13434#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13435#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13436#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13437#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13438#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 13439#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))]
[2018-02-02 10:42:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked.
[2018-02-02 10:42:47,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:42:47,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:42:47,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:42:47,523 INFO L87 Difference]: Start difference. First operand 310 states and 345 transitions. Second operand 20 states.
[2018-02-02 10:42:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:47,599 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions.
[2018-02-02 10:42:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:42:47,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1855
[2018-02-02 10:42:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:47,600 INFO L225 Difference]: With dead ends: 323
[2018-02-02 10:42:47,600 INFO L226 Difference]: Without dead ends: 320
[2018-02-02 10:42:47,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:42:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states.
[2018-02-02 10:42:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316.
[2018-02-02 10:42:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states.
[2018-02-02 10:42:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 351 transitions.
[2018-02-02 10:42:47,603 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 351 transitions. Word has length 1855
[2018-02-02 10:42:47,603 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:47,603 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 351 transitions.
[2018-02-02 10:42:47,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:42:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions.
[2018-02-02 10:42:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958
[2018-02-02 10:42:47,619 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:47,619 INFO L351 BasicCegarLoop]: trace histogram [306, 289, 289, 289, 289, 289, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:47,619 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash 546860014, now seen corresponding path program 33 times
[2018-02-02 10:42:47,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:47,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked.
[2018-02-02 10:42:51,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:51,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:42:51,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14688 trivial. 0 not checked.
[2018-02-02 10:42:51,187 INFO L182 omatonBuilderFactory]: Interpolants [14089#true, 14090#false, 14091#(= main_~i~1 0), 14092#(<= main_~i~1 1), 14093#(<= main_~i~1 2), 14094#(<= main_~i~1 3), 14095#(<= main_~i~1 4), 14096#(<= main_~i~1 5), 14097#(<= main_~i~1 6), 14098#(<= main_~i~1 7), 14099#(<= main_~i~1 8), 14100#(<= main_~i~1 9), 14101#(<= main_~i~1 10), 14102#(<= main_~i~1 11), 14103#(<= main_~i~1 12), 14104#(<= main_~i~1 13), 14105#(<= main_~i~1 14), 14106#(<= main_~i~1 15), 14107#(<= main_~i~1 16), 14108#(<= main_~i~1 17)]
[2018-02-02 10:42:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked.
[2018-02-02 10:42:51,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:42:51,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:42:51,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:42:51,190 INFO L87 Difference]: Start difference. First operand 316 states and 351 transitions. Second operand 20 states.
[2018-02-02 10:42:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:51,351 INFO L93 Difference]: Finished difference Result 424 states and 445 transitions.
[2018-02-02 10:42:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:42:51,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1957
[2018-02-02 10:42:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:51,353 INFO L225 Difference]: With dead ends: 424
[2018-02-02 10:42:51,353 INFO L226 Difference]: Without dead ends: 424
[2018-02-02 10:42:51,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:42:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states.
[2018-02-02 10:42:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 327.
[2018-02-02 10:42:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states.
[2018-02-02 10:42:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 364 transitions.
[2018-02-02 10:42:51,357 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 364 transitions. Word has length 1957
[2018-02-02 10:42:51,358 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:51,358 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 364 transitions.
[2018-02-02 10:42:51,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:42:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 364 transitions.
[2018-02-02 10:42:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072
[2018-02-02 10:42:51,374 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:51,375 INFO L351 BasicCegarLoop]: trace histogram [324, 306, 306, 306, 306, 306, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:51,375 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:51,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1829676233, now seen corresponding path program 34 times
[2018-02-02 10:42:51,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:51,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:42:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked.
[2018-02-02 10:42:56,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:42:56,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:42:56,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:42:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 1819 refuted. 0 times theorem prover too weak. 14705 trivial. 0 not checked.
[2018-02-02 10:42:56,306 INFO L182 omatonBuilderFactory]: Interpolants [14880#(not (= |foo_#in~size| 32)), 14860#true, 14861#false, 14862#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14863#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14864#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14865#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14866#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14867#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14868#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14869#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14870#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 14871#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14872#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14873#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14874#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14875#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14876#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14877#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14878#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14879#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))]
[2018-02-02 10:42:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked.
[2018-02-02 10:42:56,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 10:42:56,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 10:42:56,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:42:56,310 INFO L87 Difference]: Start difference. First operand 327 states and 364 transitions. Second operand 21 states.
[2018-02-02 10:42:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:42:56,388 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions.
[2018-02-02 10:42:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:42:56,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2071
[2018-02-02 10:42:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:42:56,389 INFO L225 Difference]: With dead ends: 340
[2018-02-02 10:42:56,389 INFO L226 Difference]: Without dead ends: 337
[2018-02-02 10:42:56,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:42:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2018-02-02 10:42:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333.
[2018-02-02 10:42:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states.
[2018-02-02 10:42:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 370 transitions.
[2018-02-02 10:42:56,394 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 370 transitions. Word has length 2071
[2018-02-02 10:42:56,394 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:42:56,394 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 370 transitions.
[2018-02-02 10:42:56,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 10:42:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 370 transitions.
[2018-02-02 10:42:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2180
[2018-02-02 10:42:56,416 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:42:56,417 INFO L351 BasicCegarLoop]: trace histogram [342, 324, 324, 324, 324, 324, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:42:56,417 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:42:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 771837319, now seen corresponding path program 35 times
[2018-02-02 10:42:56,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:42:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:42:56,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked.
[2018-02-02 10:43:00,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:00,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:43:00,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17442 trivial. 0 not checked.
[2018-02-02 10:43:00,866 INFO L182 omatonBuilderFactory]: Interpolants [15556#true, 15557#false, 15558#(= main_~i~1 0), 15559#(<= main_~i~1 1), 15560#(<= main_~i~1 2), 15561#(<= main_~i~1 3), 15562#(<= main_~i~1 4), 15563#(<= main_~i~1 5), 15564#(<= main_~i~1 6), 15565#(<= main_~i~1 7), 15566#(<= main_~i~1 8), 15567#(<= main_~i~1 9), 15568#(<= main_~i~1 10), 15569#(<= main_~i~1 11), 15570#(<= main_~i~1 12), 15571#(<= main_~i~1 13), 15572#(<= main_~i~1 14), 15573#(<= main_~i~1 15), 15574#(<= main_~i~1 16), 15575#(<= main_~i~1 17), 15576#(<= main_~i~1 18)]
[2018-02-02 10:43:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked.
[2018-02-02 10:43:00,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 10:43:00,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 10:43:00,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:43:00,870 INFO L87 Difference]: Start difference. First operand 333 states and 370 transitions. Second operand 21 states.
[2018-02-02 10:43:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:01,083 INFO L93 Difference]: Finished difference Result 446 states and 468 transitions.
[2018-02-02 10:43:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:43:01,084 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2179
[2018-02-02 10:43:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:01,086 INFO L225 Difference]: With dead ends: 446
[2018-02-02 10:43:01,086 INFO L226 Difference]: Without dead ends: 446
[2018-02-02 10:43:01,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:43:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states.
[2018-02-02 10:43:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344.
[2018-02-02 10:43:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states.
[2018-02-02 10:43:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 383 transitions.
[2018-02-02 10:43:01,090 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 383 transitions. Word has length 2179
[2018-02-02 10:43:01,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:01,091 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 383 transitions.
[2018-02-02 10:43:01,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 10:43:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 383 transitions.
[2018-02-02 10:43:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300
[2018-02-02 10:43:01,111 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:01,112 INFO L351 BasicCegarLoop]: trace histogram [361, 342, 342, 342, 342, 342, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:01,112 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:43:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1752930392, now seen corresponding path program 36 times
[2018-02-02 10:43:01,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:01,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked.
[2018-02-02 10:43:07,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:07,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:43:07,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19494 backedges. 0 proven. 2034 refuted. 0 times theorem prover too weak. 17460 trivial. 0 not checked.
[2018-02-02 10:43:07,433 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16385#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16386#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16387#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16388#(not (= |foo_#in~size| 32)), 16367#true, 16368#false, 16369#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16370#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16371#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16372#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16373#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16374#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16375#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16376#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16377#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 16378#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16379#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16380#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16381#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16382#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16383#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))]
[2018-02-02 10:43:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked.
[2018-02-02 10:43:07,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:43:07,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:43:07,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:43:07,439 INFO L87 Difference]: Start difference. First operand 344 states and 383 transitions. Second operand 22 states.
[2018-02-02 10:43:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:07,553 INFO L93 Difference]: Finished difference Result 357 states and 396 transitions.
[2018-02-02 10:43:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:43:07,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2299
[2018-02-02 10:43:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:07,555 INFO L225 Difference]: With dead ends: 357
[2018-02-02 10:43:07,555 INFO L226 Difference]: Without dead ends: 354
[2018-02-02 10:43:07,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:43:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2018-02-02 10:43:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350.
[2018-02-02 10:43:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states.
[2018-02-02 10:43:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 389 transitions.
[2018-02-02 10:43:07,559 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 389 transitions. Word has length 2299
[2018-02-02 10:43:07,559 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:07,560 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 389 transitions.
[2018-02-02 10:43:07,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:43:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 389 transitions.
[2018-02-02 10:43:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2414
[2018-02-02 10:43:07,586 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:07,586 INFO L351 BasicCegarLoop]: trace histogram [380, 361, 361, 361, 361, 361, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:07,586 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]===
[2018-02-02 10:43:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 760102000, now seen corresponding path program 37 times
[2018-02-02 10:43:07,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:07,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
Received shutdown request...
[2018-02-02 10:43:09,175 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver:
de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201)
at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.<init>(NestedInterpolantsBuilder.java:164)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:106)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:68)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:115)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2018-02-02 10:43:09,178 INFO L168 Benchmark]: Toolchain (without parser) took 56877.45 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 360.8 MB in the beginning and 669.3 MB in the end (delta: -308.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,179 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.17 ms. Allocated memory is still 402.7 MB. Free memory was 360.8 MB in the beginning and 352.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,179 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 ms. Allocated memory is still 402.7 MB. Free memory was 352.9 MB in the beginning and 350.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,179 INFO L168 Benchmark]: RCFGBuilder took 198.52 ms. Allocated memory is still 402.7 MB. Free memory was 350.2 MB in the beginning and 334.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,180 INFO L168 Benchmark]: TraceAbstraction took 56512.56 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.2 MB in the beginning and 669.3 MB in the end (delta: -336.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB.
[2018-02-02 10:43:09,181 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.23 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 142.17 ms. Allocated memory is still 402.7 MB. Free memory was 360.8 MB in the beginning and 352.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 21.13 ms. Allocated memory is still 402.7 MB. Free memory was 352.9 MB in the beginning and 350.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 198.52 ms. Allocated memory is still 402.7 MB. Free memory was 350.2 MB in the beginning and 334.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 56512.56 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.2 MB in the beginning and 669.3 MB in the end (delta: -336.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: SMTLIBException: Timeout exceeded
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-43-09-187.csv
Completed graceful shutdown