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/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:36:25,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:36:25,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:36:25,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:36:25,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:36:25,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:36:25,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:36:25,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:36:25,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:36:25,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:36:25,442 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:36:25,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:36:25,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:36:25,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:36:25,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:36:25,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:36:25,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:36:25,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:36:25,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:36:25,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:36:25,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:36:25,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:36:25,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:36:25,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:36:25,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:36:25,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:36:25,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:36:25,456 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:36:25,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:36:25,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:36:25,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:36:25,458 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 17:36:25,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:36:25,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:36:25,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:36:25,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:36:25,469 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:36:25,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:36:25,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:36:25,470 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:36:25,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:36:25,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:36:25,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:36:25,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:36:25,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:36:25,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:36:25,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:36:25,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:36:25,472 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:36:25,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:36:25,472 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:36:25,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:36:25,510 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:36:25,513 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:36:25,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:36:25,515 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:36:25,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:36:25,644 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:36:25,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:36:25,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:36:25,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:36:25,652 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:36:25,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac502e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25, skipping insertion in model container [2018-02-04 17:36:25,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,671 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:36:25,698 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:36:25,789 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:36:25,800 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:36:25,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25 WrapperNode [2018-02-04 17:36:25,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:36:25,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:36:25,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:36:25,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:36:25,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... [2018-02-04 17:36:25,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:36:25,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:36:25,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:36:25,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:36:25,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:36:25,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:36:25,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:36:25,872 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-04 17:36:25,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:36:25,872 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:36:25,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:36:25,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:36:25,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:36:25,872 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:36:25,873 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:36:25,873 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-04 17:36:25,873 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:36:25,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:36:25,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:36:25,984 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:36:25,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:36:25 BoogieIcfgContainer [2018-02-04 17:36:25,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:36:25,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:36:25,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:36:25,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:36:25,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:36:25" (1/3) ... [2018-02-04 17:36:25,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5230b84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:36:25, skipping insertion in model container [2018-02-04 17:36:25,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:25" (2/3) ... [2018-02-04 17:36:25,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5230b84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:36:25, skipping insertion in model container [2018-02-04 17:36:25,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:36:25" (3/3) ... [2018-02-04 17:36:25,989 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:36:25,994 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:36:25,999 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 17:36:26,035 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:36:26,035 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:36:26,035 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:36:26,035 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:36:26,035 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:36:26,035 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:36:26,036 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:36:26,036 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:36:26,036 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:36:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 17:36:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:36:26,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,056 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,056 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-04 17:36:26,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,107 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,212 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 17:36:26,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:26,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:36:26,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:36:26,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:36:26,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:36:26,230 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-04 17:36:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:26,286 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 17:36:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:36:26,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:36:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:26,337 INFO L225 Difference]: With dead ends: 33 [2018-02-04 17:36:26,337 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 17:36:26,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 17:36:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 17:36:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 17:36:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 17:36:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-04 17:36:26,359 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-04 17:36:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:26,359 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-04 17:36:26,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:36:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-04 17:36:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:36:26,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,360 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,360 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-04 17:36:26,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,360 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,440 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 17:36:26,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:26,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:36:26,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:36:26,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:36:26,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:36:26,442 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-04 17:36:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:26,495 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-04 17:36:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:26,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:36:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:26,497 INFO L225 Difference]: With dead ends: 29 [2018-02-04 17:36:26,497 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 17:36:26,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 17:36:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 17:36:26,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 17:36:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-04 17:36:26,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-04 17:36:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:26,501 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-04 17:36:26,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:36:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-04 17:36:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:36:26,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,502 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-04 17:36:26,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,552 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 17:36:26,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:26,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:36:26,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:36:26,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:36:26,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:36:26,554 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-04 17:36:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:26,598 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-04 17:36:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:36:26,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 17:36:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:26,599 INFO L225 Difference]: With dead ends: 28 [2018-02-04 17:36:26,600 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 17:36:26,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 17:36:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 17:36:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 17:36:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 17:36:26,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 17:36:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:26,603 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 17:36:26,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:36:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 17:36:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:36:26,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,604 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-04 17:36:26,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,604 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,694 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 17:36:26,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:26,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:36:26,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:36:26,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:36:26,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:36:26,696 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-04 17:36:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:26,767 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-04 17:36:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:36:26,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 17:36:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:26,769 INFO L225 Difference]: With dead ends: 37 [2018-02-04 17:36:26,769 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 17:36:26,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:36:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 17:36:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-04 17:36:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 17:36:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-04 17:36:26,772 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-04 17:36:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:26,772 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-04 17:36:26,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:36:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-04 17:36:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:36:26,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,773 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,773 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-04 17:36:26,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,773 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:26,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:26,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:36:26,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:36:26,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:36:26,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:36:26,800 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-04 17:36:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:26,805 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-04 17:36:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:36:26,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-04 17:36:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:26,806 INFO L225 Difference]: With dead ends: 32 [2018-02-04 17:36:26,806 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 17:36:26,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:36:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 17:36:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 17:36:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 17:36:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-04 17:36:26,809 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-04 17:36:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:26,810 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-04 17:36:26,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:36:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-04 17:36:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:36:26,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:26,811 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:26,811 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-04 17:36:26,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:26,811 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:26,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:26,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:26,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:26,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:26,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:26,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:26,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 17:36:26,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:36:26,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:36:26,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:36:26,962 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-02-04 17:36:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:27,021 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-04 17:36:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:36:27,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 17:36:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:27,023 INFO L225 Difference]: With dead ends: 58 [2018-02-04 17:36:27,023 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 17:36:27,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:36:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 17:36:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 17:36:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:36:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 17:36:27,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 17:36:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:27,027 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 17:36:27,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:36:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 17:36:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:36:27,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:27,028 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:27,028 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 122677308, now seen corresponding path program 1 times [2018-02-04 17:36:27,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:27,029 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:27,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:27,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:27,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:27,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:27,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:27,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:36:27,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:36:27,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:36:27,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:36:27,128 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 10 states. [2018-02-04 17:36:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:27,241 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-04 17:36:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:36:27,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 17:36:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:27,242 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:36:27,242 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:36:27,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:36:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:36:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-04 17:36:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 17:36:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-04 17:36:27,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-04 17:36:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:27,248 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-04 17:36:27,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:36:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-04 17:36:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:36:27,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:27,248 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:27,249 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-04 17:36:27,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:27,249 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:27,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:27,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:27,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:27,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:27,408 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 17:36:27,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:27,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:27,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:27,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:27,452 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 17:36:27,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:27,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:27,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:27,477 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 16 treesize of output 13 [2018-02-04 17:36:27,478 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 13 treesize of output 12 [2018-02-04 17:36:27,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:27,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:27,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:27,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:36:27,539 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 20 treesize of output 16 [2018-02-04 17:36:27,549 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:36:27,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:27,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:27,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:27,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:36:27,652 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 17:36:27,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:27,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-04 17:36:27,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:36:27,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:36:27,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:36:27,653 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 20 states. [2018-02-04 17:36:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:28,046 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 17:36:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:36:28,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2018-02-04 17:36:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:28,047 INFO L225 Difference]: With dead ends: 85 [2018-02-04 17:36:28,047 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 17:36:28,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:36:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 17:36:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-04 17:36:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 17:36:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-04 17:36:28,053 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-04 17:36:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:28,053 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-04 17:36:28,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:36:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-04 17:36:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:36:28,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:28,055 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] [2018-02-04 17:36:28,055 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-04 17:36:28,055 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:28,055 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:28,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:28,108 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 17:36:28,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:28,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:36:28,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:36:28,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:36:28,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:28,109 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-04 17:36:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:28,162 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-04 17:36:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:36:28,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 17:36:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:28,163 INFO L225 Difference]: With dead ends: 96 [2018-02-04 17:36:28,163 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:36:28,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:36:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:36:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-04 17:36:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 17:36:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-04 17:36:28,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-04 17:36:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:28,173 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-04 17:36:28,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:36:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-04 17:36:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:36:28,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:28,175 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] [2018-02-04 17:36:28,175 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-04 17:36:28,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:28,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:28,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:28,191 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:28,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:28,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:28,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:28,237 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 17:36:28,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:28,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:36:28,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:36:28,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:36:28,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:36:28,239 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-02-04 17:36:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:28,286 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-02-04 17:36:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:36:28,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:36:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:28,288 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:36:28,288 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 17:36:28,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:36:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 17:36:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2018-02-04 17:36:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 17:36:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-02-04 17:36:28,292 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 23 [2018-02-04 17:36:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:28,293 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-02-04 17:36:28,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:36:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-02-04 17:36:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:36:28,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:28,293 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] [2018-02-04 17:36:28,293 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836871, now seen corresponding path program 1 times [2018-02-04 17:36:28,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:28,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:28,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:28,304 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:28,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:28,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:28,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:28,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:28,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 17:36:28,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,343 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 17:36:28,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:36:28,358 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc6.base| 0)))) is different from true [2018-02-04 17:36:28,360 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 17:36:28,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:28,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:36:28,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:36:28,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:36:28,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:36:28,361 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 6 states. [2018-02-04 17:36:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:28,393 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-02-04 17:36:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:28,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 17:36:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:28,393 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:36:28,393 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 17:36:28,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:36:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 17:36:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 17:36:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 17:36:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-04 17:36:28,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-02-04 17:36:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:28,399 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-04 17:36:28,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:36:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-04 17:36:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:36:28,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:28,400 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:28,400 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 2 times [2018-02-04 17:36:28,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:28,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:28,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:28,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:28,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:28,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:28,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:28,602 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:36:28,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:36:28,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:28,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:28,628 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 17:36:28,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:28,650 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 16 treesize of output 13 [2018-02-04 17:36:28,652 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 13 treesize of output 12 [2018-02-04 17:36:28,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:28,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:36:28,762 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 17:36:28,767 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:36:28,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:28,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:28,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:28,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-02-04 17:36:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:28,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:28,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-04 17:36:28,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:36:28,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:36:28,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:36:28,871 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-02-04 17:36:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:29,158 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-04 17:36:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:36:29,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-04 17:36:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:29,158 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:36:29,158 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:36:29,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:36:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:36:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-02-04 17:36:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:36:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-04 17:36:29,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2018-02-04 17:36:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:29,160 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-04 17:36:29,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:36:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-04 17:36:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:36:29,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:29,161 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:29,161 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:36:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 139174314, now seen corresponding path program 3 times [2018-02-04 17:36:29,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:29,162 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:29,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:29,162 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:36:29,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:29,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 17:36:29,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:29,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:29,313 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:36:29,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:36:29,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:29,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:29,371 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 17:36:29,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:29,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:29,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:29,385 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 15 treesize of output 12 [2018-02-04 17:36:29,387 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 12 treesize of output 11 [2018-02-04 17:36:29,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:29,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:29,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:29,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:36:29,427 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 17:36:29,435 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:36:29,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:29,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:29,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:29,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:36:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 17:36:29,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:29,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-02-04 17:36:29,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:36:29,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:36:29,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:36:29,519 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-02-04 17:36:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:29,795 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-02-04 17:36:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:36:29,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-04 17:36:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:29,795 INFO L225 Difference]: With dead ends: 34 [2018-02-04 17:36:29,796 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:36:29,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:36:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:36:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:36:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:36:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:36:29,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-04 17:36:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:29,797 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:36:29,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:36:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:36:29,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:36:29,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:36:29 BoogieIcfgContainer [2018-02-04 17:36:29,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:36:29,801 INFO L168 Benchmark]: Toolchain (without parser) took 4156.62 ms. Allocated memory was 396.9 MB in the beginning and 676.3 MB in the end (delta: 279.4 MB). Free memory was 353.6 MB in the beginning and 496.2 MB in the end (delta: -142.6 MB). Peak memory consumption was 136.8 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:29,802 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:36:29,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.09 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 342.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:29,802 INFO L168 Benchmark]: Boogie Preprocessor took 26.89 ms. Allocated memory is still 396.9 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:29,802 INFO L168 Benchmark]: RCFGBuilder took 151.25 ms. Allocated memory is still 396.9 MB. Free memory was 341.6 MB in the beginning and 325.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:29,802 INFO L168 Benchmark]: TraceAbstraction took 3815.47 ms. Allocated memory was 396.9 MB in the beginning and 676.3 MB in the end (delta: 279.4 MB). Free memory was 324.4 MB in the beginning and 496.2 MB in the end (delta: -171.8 MB). Peak memory consumption was 107.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:29,803 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.17 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.09 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 342.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.89 ms. Allocated memory is still 396.9 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 151.25 ms. Allocated memory is still 396.9 MB. Free memory was 341.6 MB in the beginning and 325.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3815.47 ms. Allocated memory was 396.9 MB in the beginning and 676.3 MB in the end (delta: 279.4 MB). Free memory was 324.4 MB in the beginning and 496.2 MB in the end (delta: -171.8 MB). Peak memory consumption was 107.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 3.7s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 323 SDtfs, 416 SDslu, 1195 SDs, 0 SdLazy, 855 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=9, 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, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 362 ConstructedInterpolants, 15 QuantifiedInterpolants, 66670 SizeOfPredicates, 32 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 25/95 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-36-29-808.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-36-29-808.csv Received shutdown request...