java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:07:07,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:07:07,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:07:07,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:07:07,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:07:07,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:07:07,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:07:07,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:07:07,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:07:07,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:07:07,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:07:07,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:07:07,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:07:07,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:07:07,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:07:07,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:07:07,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:07:07,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:07:07,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:07:07,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:07:07,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:07:07,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:07:07,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:07:07,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:07:07,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:07:07,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:07:07,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:07:07,324 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:07:07,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:07:07,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:07:07,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:07:07,325 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:07:07,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:07:07,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:07:07,336 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:07:07,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:07:07,336 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:07:07,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:07:07,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:07:07,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:07:07,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:07:07,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:07:07,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:07:07,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:07:07,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:07:07,338 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:07:07,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:07:07,338 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:07:07,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:07:07,373 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:07:07,375 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:07:07,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:07:07,376 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:07:07,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 18:07:07,530 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:07:07,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:07:07,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:07:07,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:07:07,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:07:07,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dce5039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07, skipping insertion in model container [2018-02-04 18:07:07,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,558 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:07:07,589 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:07:07,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:07:07,690 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:07:07,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07 WrapperNode [2018-02-04 18:07:07,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:07:07,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:07:07,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:07:07,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:07:07,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... [2018-02-04 18:07:07,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:07:07,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:07:07,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:07:07,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:07:07,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:07:07,759 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:07:07,760 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:07:07,760 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:07:07,760 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:07:07,760 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-04 18:07:07,761 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:07:07,761 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:07:07,855 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 18:07:07,930 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:07:07,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:07:07 BoogieIcfgContainer [2018-02-04 18:07:07,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:07:07,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:07:07,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:07:07,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:07:07,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:07:07" (1/3) ... [2018-02-04 18:07:07,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa5b95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:07:07, skipping insertion in model container [2018-02-04 18:07:07,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:07:07" (2/3) ... [2018-02-04 18:07:07,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa5b95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:07:07, skipping insertion in model container [2018-02-04 18:07:07,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:07:07" (3/3) ... [2018-02-04 18:07:07,936 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 18:07:07,942 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:07:07,946 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 18:07:07,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:07:07,968 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:07:07,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:07:07,968 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:07:07,968 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:07:07,968 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:07:07,968 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:07:07,968 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:07:07,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:07:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-04 18:07:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 18:07:07,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:07,986 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 18:07:07,986 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-04 18:07:07,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:07,992 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:08,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:08,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:07:08,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:07:08,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:07:08,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,123 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-04 18:07:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:08,232 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 18:07:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:07:08,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 18:07:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:08,244 INFO L225 Difference]: With dead ends: 60 [2018-02-04 18:07:08,244 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 18:07:08,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 18:07:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 18:07:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 18:07:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 18:07:08,330 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-04 18:07:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:08,330 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 18:07:08,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:07:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 18:07:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 18:07:08,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:08,331 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 18:07:08,331 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-04 18:07:08,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:08,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:08,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:08,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:07:08,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:07:08,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:07:08,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,388 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-04 18:07:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:08,423 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 18:07:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:07:08,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 18:07:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:08,425 INFO L225 Difference]: With dead ends: 53 [2018-02-04 18:07:08,425 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 18:07:08,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 18:07:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 18:07:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 18:07:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 18:07:08,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-04 18:07:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:08,431 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 18:07:08,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:07:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 18:07:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:07:08,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:08,432 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:08,432 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-04 18:07:08,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:08,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:08,498 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:08,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:08,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:08,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:08,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:08,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:07:08,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:07:08,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:08,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:07:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:08,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:08,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:07:08,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:07:08,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:07:08,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,613 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-04 18:07:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:08,656 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-04 18:07:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:07:08,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 18:07:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:08,657 INFO L225 Difference]: With dead ends: 51 [2018-02-04 18:07:08,657 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:07:08,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:07:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:07:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:07:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 18:07:08,661 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-04 18:07:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:08,661 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 18:07:08,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:07:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 18:07:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:07:08,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:08,661 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:08,661 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-04 18:07:08,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:08,662 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:08,685 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:08,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:08,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:08,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:08,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:07:08,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:08,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:07:08,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:08,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:07:08,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2018-02-04 18:07:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:08,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:08,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:07:08,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:07:08,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:07:08,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:07:08,763 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-04 18:07:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:08,795 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 18:07:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:07:08,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 18:07:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:08,796 INFO L225 Difference]: With dead ends: 49 [2018-02-04 18:07:08,796 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 18:07:08,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:07:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 18:07:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 18:07:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:07:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 18:07:08,800 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-04 18:07:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:08,801 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 18:07:08,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:07:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 18:07:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:07:08,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:08,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:08,801 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-04 18:07:08,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:08,802 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:08,826 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:08,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:08,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:08,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:08,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:08,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:08,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:07:08,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:07:08,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:08,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:08,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 18:07:08,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:08,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:07:08,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:08,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:07:08,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2018-02-04 18:07:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:08,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:08,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:07:08,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:07:08,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:07:08,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:07:08,940 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 4 states. [2018-02-04 18:07:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:08,987 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-04 18:07:08,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:07:08,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 18:07:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:08,989 INFO L225 Difference]: With dead ends: 48 [2018-02-04 18:07:08,989 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 18:07:08,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:07:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 18:07:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 18:07:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 18:07:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-04 18:07:08,993 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 15 [2018-02-04 18:07:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:08,993 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-04 18:07:08,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:07:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-04 18:07:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 18:07:08,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:08,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:08,995 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-04 18:07:08,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:08,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:08,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:08,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:08,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:09,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:09,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:07:09,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:07:09,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:07:09,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:09,035 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 3 states. [2018-02-04 18:07:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:09,065 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-02-04 18:07:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:07:09,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 18:07:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:09,066 INFO L225 Difference]: With dead ends: 46 [2018-02-04 18:07:09,066 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 18:07:09,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 18:07:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 18:07:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 18:07:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 18:07:09,068 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-02-04 18:07:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:09,069 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 18:07:09,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:07:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 18:07:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 18:07:09,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:09,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:09,070 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-04 18:07:09,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:09,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:09,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:09,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:09,081 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:09,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:09,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:09,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:09,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:09,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:07:09,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:07:09,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:07:09,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:07:09,118 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 4 states. [2018-02-04 18:07:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:09,142 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 18:07:09,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:07:09,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-04 18:07:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:09,143 INFO L225 Difference]: With dead ends: 52 [2018-02-04 18:07:09,143 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 18:07:09,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:07:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 18:07:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 18:07:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 18:07:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-04 18:07:09,146 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 27 [2018-02-04 18:07:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:09,147 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-04 18:07:09,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:07:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-04 18:07:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:07:09,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:09,148 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:09,148 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422322, now seen corresponding path program 1 times [2018-02-04 18:07:09,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:09,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:09,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:09,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:09,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:09,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:09,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:09,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:07:09,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-02-04 18:07:09,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:07:09,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:07:09,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:07:09,240 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 8 states. [2018-02-04 18:07:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:09,270 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-04 18:07:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:07:09,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 18:07:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:09,272 INFO L225 Difference]: With dead ends: 54 [2018-02-04 18:07:09,272 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 18:07:09,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:07:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 18:07:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 18:07:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 18:07:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 18:07:09,275 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 28 [2018-02-04 18:07:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:09,275 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 18:07:09,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:07:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 18:07:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:07:09,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:09,276 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] [2018-02-04 18:07:09,276 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash -944250099, now seen corresponding path program 2 times [2018-02-04 18:07:09,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:09,277 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:09,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,278 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:09,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:09,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:09,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:09,333 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:07:09,356 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 18:07:09,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:07:09,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:09,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:09,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:07:09,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:07:09,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 18:07:09,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-02-04 18:07:09,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:07:09,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:09,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:09,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:11 [2018-02-04 18:07:09,487 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~0.base| Int) (|foo_#t~malloc0.base| Int)) (and (<= (select |c_old(#valid)| |foo_~#p~0.base|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |foo_~#p~0.base| 1) |foo_#t~malloc0.base| 1) |foo_~#p~0.base| 0)))) is different from true [2018-02-04 18:07:09,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 18:07:09,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-04 18:07:09,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2018-02-04 18:07:09,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:09,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:07:09,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:07:09,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:07:09,557 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:28 [2018-02-04 18:07:09,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:09,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 18:07:09,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:09,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:07:09,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:32 [2018-02-04 18:07:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:07:09,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:07:09,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2018-02-04 18:07:09,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:07:09,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:07:09,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=120, Unknown=2, NotChecked=22, Total=182 [2018-02-04 18:07:09,626 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 14 states. [2018-02-04 18:07:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:09,932 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 18:07:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:07:09,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-02-04 18:07:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:09,933 INFO L225 Difference]: With dead ends: 55 [2018-02-04 18:07:09,933 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:07:09,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=4, NotChecked=38, Total=462 [2018-02-04 18:07:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:07:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:07:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:07:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 18:07:09,936 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 29 [2018-02-04 18:07:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:09,936 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 18:07:09,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:07:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 18:07:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:07:09,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:09,937 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:09,937 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash -169780369, now seen corresponding path program 1 times [2018-02-04 18:07:09,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:09,937 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:09,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,938 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:07:09,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:09,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:07:09,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:09,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:07:09,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:07:09,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:07:09,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:09,993 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 3 states. [2018-02-04 18:07:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:10,016 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 18:07:10,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:07:10,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-04 18:07:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:10,017 INFO L225 Difference]: With dead ends: 49 [2018-02-04 18:07:10,017 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 18:07:10,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:07:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 18:07:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 18:07:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:07:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 18:07:10,020 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2018-02-04 18:07:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:10,021 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 18:07:10,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:07:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 18:07:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:07:10,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:10,022 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:10,022 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -169780368, now seen corresponding path program 1 times [2018-02-04 18:07:10,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:10,022 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:10,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:10,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:10,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:10,046 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:10,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:10,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:10,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:10,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:07:10,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:07:10,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 18:07:10,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:07:10,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:07:10,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:07:10,106 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 7 states. [2018-02-04 18:07:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:10,148 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 18:07:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:07:10,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 18:07:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:10,152 INFO L225 Difference]: With dead ends: 55 [2018-02-04 18:07:10,152 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 18:07:10,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:07:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 18:07:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 18:07:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:07:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 18:07:10,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 30 [2018-02-04 18:07:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:10,156 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 18:07:10,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:07:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 18:07:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:07:10,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:10,157 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:10,157 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022545, now seen corresponding path program 2 times [2018-02-04 18:07:10,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:10,157 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:10,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:10,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:10,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:10,177 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:10,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:10,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:10,178 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:07:10,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 18:07:10,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:07:10,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:10,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:10,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:10,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:07:10,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:07:10,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:07:10,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 18:07:10,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-02-04 18:07:10,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:07:10,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:10,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:07:10,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-02-04 18:07:10,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:07:10,314 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:18, output treesize:24 [2018-02-04 18:07:10,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-02-04 18:07:10,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 17 treesize of output 28 [2018-02-04 18:07:10,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:07:10,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:07:10,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 18:07:10,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:10,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:07:10,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:60 [2018-02-04 18:07:10,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2018-02-04 18:07:10,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:10,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 18:07:10,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:07:10,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 18:07:10,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:75 [2018-02-04 18:07:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 18:07:10,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:07:10,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:07:10,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:07:10,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:07:10,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=50, Unknown=4, NotChecked=0, Total=72 [2018-02-04 18:07:10,633 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 9 states. [2018-02-04 18:07:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:10,887 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 18:07:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:07:10,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 18:07:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:10,888 INFO L225 Difference]: With dead ends: 50 [2018-02-04 18:07:10,888 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 18:07:10,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=149, Unknown=7, NotChecked=0, Total=210 [2018-02-04 18:07:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 18:07:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 18:07:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 18:07:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 18:07:10,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 31 [2018-02-04 18:07:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:10,892 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 18:07:10,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:07:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 18:07:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 18:07:10,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:10,893 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:10,893 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 1 times [2018-02-04 18:07:10,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:10,893 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:10,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,894 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:07:10,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:10,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:10,953 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:10,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:10,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:10,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:11,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:11,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:07:11,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:07:11,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 18:07:11,720 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 102 DAG size of output 40 [2018-02-04 18:07:11,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 62 [2018-02-04 18:07:11,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-02-04 18:07:11,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-02-04 18:07:11,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 76 [2018-02-04 18:07:11,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:11,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 104 [2018-02-04 18:07:11,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:11,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:11,854 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:209, output treesize:84 [2018-02-04 18:07:22,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 56 [2018-02-04 18:07:22,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:22,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-02-04 18:07:22,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:22,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-02-04 18:07:22,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:22,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:07:22,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:22,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:22,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:22,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:7 [2018-02-04 18:07:27,954 WARN L146 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 126 DAG size of output 64 [2018-02-04 18:07:27,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 116 [2018-02-04 18:07:27,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:27,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,001 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,007 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,011 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,015 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,019 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,023 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,024 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,024 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,025 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 6 disjoint index pairs (out of 78 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 271 [2018-02-04 18:07:28,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,105 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 113 [2018-02-04 18:07:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,121 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 68 [2018-02-04 18:07:28,132 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-02-04 18:07:28,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 110 [2018-02-04 18:07:28,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-02-04 18:07:28,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 76 [2018-02-04 18:07:28,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 104 [2018-02-04 18:07:28,334 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,345 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:28,438 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:274, output treesize:149 [2018-02-04 18:07:28,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 109 [2018-02-04 18:07:28,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,521 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,526 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,528 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,531 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,531 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,534 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,537 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:28,539 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 6 disjoint index pairs (out of 105 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 248 [2018-02-04 18:07:28,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,768 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 18:07:28,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,825 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:07:28,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 18:07:28,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:28,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:148, output treesize:3 [2018-02-04 18:07:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 37 refuted. 6 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:07:28,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:07:28,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:07:28,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:07:28,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:07:28,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=286, Unknown=36, NotChecked=0, Total=380 [2018-02-04 18:07:28,871 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 20 states. [2018-02-04 18:07:53,802 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 70 [2018-02-04 18:07:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:07:58,800 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-02-04 18:07:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:07:58,801 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 18:07:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:07:58,803 INFO L225 Difference]: With dead ends: 73 [2018-02-04 18:07:58,803 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 18:07:58,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=62, NotChecked=0, Total=992 [2018-02-04 18:07:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 18:07:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-02-04 18:07:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 18:07:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 18:07:58,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 43 [2018-02-04 18:07:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:07:58,812 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 18:07:58,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:07:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 18:07:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 18:07:58,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:07:58,813 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:07:58,813 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:07:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-04 18:07:58,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:07:58,814 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:07:58,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:58,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:58,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:07:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:58,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:07:58,866 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:07:58,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:07:58,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:07:58,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:07:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:07:59,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:07:59,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:59,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:07:59,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 18:07:59,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:59,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:59,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 18:07:59,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:59,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:07:59,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 18:07:59,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 18:07:59,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:07:59,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:07:59,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:07:59,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-02-04 18:07:59,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 18:07:59,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 18:07:59,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:59,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:59,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:07:59,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 18:08:05,911 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 120 DAG size of output 59 [2018-02-04 18:08:05,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-02-04 18:08:05,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:08:05,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 74 [2018-02-04 18:08:05,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 77 [2018-02-04 18:08:05,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-02-04 18:08:05,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-02-04 18:08:05,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:05,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-02-04 18:08:05,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:08:05,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:08:05,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,062 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:244, output treesize:120 [2018-02-04 18:08:06,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-02-04 18:08:06,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:100, output treesize:86 [2018-02-04 18:08:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:08:06,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:08:06,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 18:08:06,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:95, output treesize:192 [2018-02-04 18:08:06,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 85 [2018-02-04 18:08:06,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,478 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:08:06,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 86 [2018-02-04 18:08:06,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-04 18:08:06,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 18:08:06,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:08:06,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2018-02-04 18:08:06,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:08:06,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 18:08:06,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:08:06,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 18:08:06,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-02-04 18:08:06,681 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:08:06,705 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:08:06,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-02-04 18:08:06,748 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:192, output treesize:107 [2018-02-04 18:08:07,585 WARN L143 SmtUtils]: Spent 636ms on a formula simplification that was a NOOP. DAG size: 35 Received shutdown request... [2018-02-04 18:10:51,830 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 18:10:51,830 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:10:51,833 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:10:51,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:10:51 BoogieIcfgContainer [2018-02-04 18:10:51,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:10:51,834 INFO L168 Benchmark]: Toolchain (without parser) took 224303.49 ms. Allocated memory was 398.5 MB in the beginning and 750.8 MB in the end (delta: 352.3 MB). Free memory was 354.9 MB in the beginning and 504.6 MB in the end (delta: -149.7 MB). Peak memory consumption was 202.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:10:51,835 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 398.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:10:51,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.02 ms. Allocated memory is still 398.5 MB. Free memory was 354.9 MB in the beginning and 344.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:10:51,836 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 ms. Allocated memory is still 398.5 MB. Free memory was 344.4 MB in the beginning and 341.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:10:51,836 INFO L168 Benchmark]: RCFGBuilder took 209.82 ms. Allocated memory is still 398.5 MB. Free memory was 341.7 MB in the beginning and 319.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:10:51,836 INFO L168 Benchmark]: TraceAbstraction took 223902.56 ms. Allocated memory was 398.5 MB in the beginning and 750.8 MB in the end (delta: 352.3 MB). Free memory was 319.1 MB in the beginning and 504.6 MB in the end (delta: -185.6 MB). Peak memory consumption was 166.8 MB. Max. memory is 5.3 GB. [2018-02-04 18:10:51,837 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.09 ms. Allocated memory is still 398.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.02 ms. Allocated memory is still 398.5 MB. Free memory was 354.9 MB in the beginning and 344.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.96 ms. Allocated memory is still 398.5 MB. Free memory was 344.4 MB in the beginning and 341.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.82 ms. Allocated memory is still 398.5 MB. Free memory was 341.7 MB in the beginning and 319.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 223902.56 ms. Allocated memory was 398.5 MB in the beginning and 750.8 MB in the end (delta: 352.3 MB). Free memory was 319.1 MB in the beginning and 504.6 MB in the end (delta: -185.6 MB). Peak memory consumption was 166.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 512. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 223.8s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 227 SDslu, 906 SDs, 0 SdLazy, 884 SolverSat, 90 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 527 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 338 ConstructedInterpolants, 53 QuantifiedInterpolants, 140091 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1419 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 25/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-10-51-844.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-10-51-844.csv Completed graceful shutdown