java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:12:37,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:12:37,439 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:12:37,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:12:37,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:12:37,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:12:37,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:12:37,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:12:37,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:12:37,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:12:37,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:12:37,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:12:37,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:12:37,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:12:37,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:12:37,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:12:37,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:12:37,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:12:37,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:12:37,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:12:37,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:12:37,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:12:37,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:12:37,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:12:37,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:12:37,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:12:37,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:12:37,484 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:12:37,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:12:37,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:12:37,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:12:37,485 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:12:37,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:12:37,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:12:37,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:12:37,494 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:12:37,494 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:12:37,494 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:12:37,494 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:12:37,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:12:37,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:12:37,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:12:37,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:12:37,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:12:37,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:12:37,497 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:12:37,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:12:37,497 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:12:37,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:12:37,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:12:37,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:12:37,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:12:37,499 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:12:37,499 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:12:37,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:12:37,541 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:12:37,544 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:12:37,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:12:37,545 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:12:37,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-30 00:12:37,720 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:12:37,726 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:12:37,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:12:37,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:12:37,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:12:37,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fec4a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37, skipping insertion in model container [2018-01-30 00:12:37,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,749 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:12:37,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:12:37,918 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:12:37,937 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:12:37,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37 WrapperNode [2018-01-30 00:12:37,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:12:37,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:12:37,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:12:37,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:12:37,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... [2018-01-30 00:12:37,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:12:37,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:12:37,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:12:37,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:12:37,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-30 00:12:38,041 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:12:38,042 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:12:38,042 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:12:38,043 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:12:38,328 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:12:38,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:12:38 BoogieIcfgContainer [2018-01-30 00:12:38,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:12:38,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:12:38,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:12:38,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:12:38,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:12:37" (1/3) ... [2018-01-30 00:12:38,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf3d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:12:38, skipping insertion in model container [2018-01-30 00:12:38,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:12:37" (2/3) ... [2018-01-30 00:12:38,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf3d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:12:38, skipping insertion in model container [2018-01-30 00:12:38,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:12:38" (3/3) ... [2018-01-30 00:12:38,338 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-30 00:12:38,347 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:12:38,355 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-30 00:12:38,398 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:12:38,398 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:12:38,399 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:12:38,399 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:12:38,399 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:12:38,399 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:12:38,399 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:12:38,399 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:12:38,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:12:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-30 00:12:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:12:38,421 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:38,422 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:38,422 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1613960843, now seen corresponding path program 1 times [2018-01-30 00:12:38,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:38,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:38,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:38,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:38,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:38,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:38,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:38,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:12:38,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:12:38,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:12:38,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:12:38,726 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2018-01-30 00:12:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:38,929 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2018-01-30 00:12:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:12:38,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-30 00:12:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:38,940 INFO L225 Difference]: With dead ends: 239 [2018-01-30 00:12:38,940 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 00:12:38,943 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:12:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 00:12:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2018-01-30 00:12:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-30 00:12:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-30 00:12:38,984 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-01-30 00:12:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:38,984 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-30 00:12:38,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:12:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-30 00:12:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:12:38,986 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:38,986 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:38,986 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2079051007, now seen corresponding path program 1 times [2018-01-30 00:12:38,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:38,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:38,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:38,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:38,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:39,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:39,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:39,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:12:39,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:12:39,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:12:39,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:39,068 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-01-30 00:12:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:39,154 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-30 00:12:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:12:39,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 00:12:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:39,157 INFO L225 Difference]: With dead ends: 124 [2018-01-30 00:12:39,157 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 00:12:39,158 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:12:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 00:12:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2018-01-30 00:12:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 00:12:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-30 00:12:39,170 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 24 [2018-01-30 00:12:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:39,170 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-30 00:12:39,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:12:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-30 00:12:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:12:39,171 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:39,171 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:39,172 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:39,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1534520130, now seen corresponding path program 1 times [2018-01-30 00:12:39,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:39,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:39,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:39,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:39,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:39,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:39,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:12:39,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:12:39,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:12:39,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:12:39,243 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 5 states. [2018-01-30 00:12:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:39,296 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-01-30 00:12:39,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:12:39,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:12:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:39,298 INFO L225 Difference]: With dead ends: 188 [2018-01-30 00:12:39,299 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:12:39,300 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-30 00:12:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:12:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-30 00:12:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-30 00:12:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-30 00:12:39,309 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 24 [2018-01-30 00:12:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:39,309 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-30 00:12:39,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:12:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-30 00:12:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:12:39,311 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:39,311 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:39,311 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash -53770488, now seen corresponding path program 1 times [2018-01-30 00:12:39,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:39,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:39,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:39,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:39,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:39,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:39,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:12:39,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:12:39,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:12:39,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:39,388 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 6 states. [2018-01-30 00:12:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:39,614 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-30 00:12:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:12:39,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:12:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:39,615 INFO L225 Difference]: With dead ends: 100 [2018-01-30 00:12:39,615 INFO L226 Difference]: Without dead ends: 99 [2018-01-30 00:12:39,616 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:12:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-30 00:12:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-30 00:12:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:12:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-30 00:12:39,626 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 25 [2018-01-30 00:12:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:39,626 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-30 00:12:39,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:12:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-30 00:12:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:12:39,627 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:39,627 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:39,627 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:39,628 INFO L82 PathProgramCache]: Analyzing trace with hash -53770487, now seen corresponding path program 1 times [2018-01-30 00:12:39,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:39,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:39,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:39,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:39,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:39,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:39,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:12:39,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:12:39,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:12:39,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:12:39,964 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 9 states. [2018-01-30 00:12:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:40,250 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-30 00:12:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:12:40,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 00:12:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:40,252 INFO L225 Difference]: With dead ends: 183 [2018-01-30 00:12:40,252 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 00:12:40,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:12:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 00:12:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-01-30 00:12:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 00:12:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-30 00:12:40,262 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 25 [2018-01-30 00:12:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:40,263 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-30 00:12:40,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:12:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-30 00:12:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:12:40,264 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:40,264 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:40,265 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1096156737, now seen corresponding path program 1 times [2018-01-30 00:12:40,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:40,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:40,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:40,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:40,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:40,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:40,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:40,539 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:40,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:40,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:40,626 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 17 treesize of output 16 [2018-01-30 00:12:40,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:40,643 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 20 treesize of output 19 [2018-01-30 00:12:40,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:40,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:12:40,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:12:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:40,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:40,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-30 00:12:40,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:12:40,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:12:40,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:12:40,991 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 20 states. [2018-01-30 00:12:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:41,430 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-30 00:12:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:12:41,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-30 00:12:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:41,431 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:12:41,431 INFO L226 Difference]: Without dead ends: 110 [2018-01-30 00:12:41,432 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:12:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-30 00:12:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-30 00:12:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:12:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-30 00:12:41,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 31 [2018-01-30 00:12:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:41,440 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-30 00:12:41,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:12:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-30 00:12:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:12:41,441 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:41,441 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:41,441 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1142492149, now seen corresponding path program 2 times [2018-01-30 00:12:41,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:41,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:41,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:41,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:41,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:41,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:41,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:41,741 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:41,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:41,768 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:41,780 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:41,782 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:41,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:41,807 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 17 treesize of output 16 [2018-01-30 00:12:41,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:41,821 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 20 treesize of output 19 [2018-01-30 00:12:41,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:41,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:12:41,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:12:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:42,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:42,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-30 00:12:42,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:12:42,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:12:42,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:12:42,248 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 24 states. [2018-01-30 00:12:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:42,884 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-30 00:12:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:12:42,884 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-30 00:12:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:42,886 INFO L225 Difference]: With dead ends: 195 [2018-01-30 00:12:42,886 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:12:42,887 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:12:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:12:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-30 00:12:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:12:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-30 00:12:42,896 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2018-01-30 00:12:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:42,897 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-30 00:12:42,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:12:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-30 00:12:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:12:42,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:42,898 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:42,898 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash 318971307, now seen corresponding path program 3 times [2018-01-30 00:12:42,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:42,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:42,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:42,900 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:42,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:42,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:43,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:43,447 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:43,453 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:43,464 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:43,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:43,468 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:43,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:43,501 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 20 treesize of output 19 [2018-01-30 00:12:43,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:43,512 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 17 treesize of output 16 [2018-01-30 00:12:43,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:43,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:12:43,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:12:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:12:45,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:45,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-30 00:12:45,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:12:45,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:12:45,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-30 00:12:45,986 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 27 states. [2018-01-30 00:12:46,713 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 61 DAG size of output 26 [2018-01-30 00:12:49,022 WARN L146 SmtUtils]: Spent 1145ms on a formula simplification. DAG size of input: 36 DAG size of output 25 [2018-01-30 00:12:50,919 WARN L146 SmtUtils]: Spent 1014ms on a formula simplification. DAG size of input: 42 DAG size of output 31 [2018-01-30 00:12:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:51,135 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-01-30 00:12:51,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:12:51,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-30 00:12:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:51,136 INFO L225 Difference]: With dead ends: 200 [2018-01-30 00:12:51,136 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 00:12:51,137 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-30 00:12:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 00:12:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-30 00:12:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 00:12:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-30 00:12:51,143 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 43 [2018-01-30 00:12:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:51,144 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-30 00:12:51,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:12:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-30 00:12:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:12:51,146 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:51,146 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:51,146 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 52914778, now seen corresponding path program 1 times [2018-01-30 00:12:51,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:51,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:51,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,148 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:51,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-30 00:12:51,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:51,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:12:51,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:12:51,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:12:51,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:12:51,267 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 5 states. [2018-01-30 00:12:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:51,352 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-30 00:12:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:12:51,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-30 00:12:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:51,354 INFO L225 Difference]: With dead ends: 195 [2018-01-30 00:12:51,355 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 00:12:51,355 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 00:12:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-30 00:12:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 00:12:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-30 00:12:51,362 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 68 [2018-01-30 00:12:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:51,362 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-30 00:12:51,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:12:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-30 00:12:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:12:51,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:51,364 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:51,364 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969414, now seen corresponding path program 1 times [2018-01-30 00:12:51,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:51,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:51,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:51,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 00:12:51,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:12:51,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:12:51,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:12:51,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:12:51,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:12:51,483 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-01-30 00:12:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:51,643 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2018-01-30 00:12:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:12:51,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-01-30 00:12:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:51,645 INFO L225 Difference]: With dead ends: 170 [2018-01-30 00:12:51,646 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 00:12:51,646 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:12:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 00:12:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-01-30 00:12:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-30 00:12:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-01-30 00:12:51,658 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 69 [2018-01-30 00:12:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:51,658 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-01-30 00:12:51,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:12:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2018-01-30 00:12:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:12:51,660 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:51,660 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:51,660 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969415, now seen corresponding path program 1 times [2018-01-30 00:12:51,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:51,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:51,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:51,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:51,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:51,781 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:51,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:51,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:51,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:51,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-30 00:12:51,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:12:51,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:12:51,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:12:51,966 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand 21 states. [2018-01-30 00:12:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:52,099 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2018-01-30 00:12:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:12:52,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-30 00:12:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:52,100 INFO L225 Difference]: With dead ends: 271 [2018-01-30 00:12:52,101 INFO L226 Difference]: Without dead ends: 160 [2018-01-30 00:12:52,101 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:12:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-30 00:12:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-01-30 00:12:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 00:12:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2018-01-30 00:12:52,110 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 69 [2018-01-30 00:12:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:52,111 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2018-01-30 00:12:52,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:12:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2018-01-30 00:12:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:12:52,112 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:52,112 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:52,112 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:52,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1251214339, now seen corresponding path program 2 times [2018-01-30 00:12:52,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:52,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:52,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:52,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:52,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:52,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:52,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:52,504 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:52,515 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:52,533 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:52,544 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:52,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 00:12:52,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:12:52,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-30 00:12:52,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:12:52,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:12:52,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:12:52,727 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand 17 states. [2018-01-30 00:12:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:53,210 INFO L93 Difference]: Finished difference Result 306 states and 337 transitions. [2018-01-30 00:12:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:12:53,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-30 00:12:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:53,212 INFO L225 Difference]: With dead ends: 306 [2018-01-30 00:12:53,212 INFO L226 Difference]: Without dead ends: 192 [2018-01-30 00:12:53,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:12:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-30 00:12:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2018-01-30 00:12:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-30 00:12:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2018-01-30 00:12:53,224 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 75 [2018-01-30 00:12:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:53,224 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2018-01-30 00:12:53,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:12:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2018-01-30 00:12:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:12:53,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:53,225 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:53,225 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1641778756, now seen corresponding path program 1 times [2018-01-30 00:12:53,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:53,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:53,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,226 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:53,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:53,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:12:53,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:53,438 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:53,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:53,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:53,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:53,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-30 00:12:53,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:12:53,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:12:53,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:12:53,644 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand 29 states. [2018-01-30 00:12:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:53,882 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-01-30 00:12:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:12:53,882 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-30 00:12:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:53,884 INFO L225 Difference]: With dead ends: 281 [2018-01-30 00:12:53,884 INFO L226 Difference]: Without dead ends: 171 [2018-01-30 00:12:53,885 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:12:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-30 00:12:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-30 00:12:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-30 00:12:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-01-30 00:12:53,896 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 81 [2018-01-30 00:12:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:53,897 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-01-30 00:12:53,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:12:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-01-30 00:12:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 00:12:53,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:53,898 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:53,898 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -784119182, now seen corresponding path program 2 times [2018-01-30 00:12:53,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:53,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:53,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:53,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:53,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:12:54,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:54,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:54,082 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:54,093 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:54,104 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:54,106 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:54,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:54,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:54,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-30 00:12:54,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:12:54,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:12:54,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:12:54,311 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-01-30 00:12:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:54,580 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2018-01-30 00:12:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:12:54,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-30 00:12:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:54,583 INFO L225 Difference]: With dead ends: 287 [2018-01-30 00:12:54,583 INFO L226 Difference]: Without dead ends: 177 [2018-01-30 00:12:54,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:12:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-30 00:12:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-01-30 00:12:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 00:12:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-01-30 00:12:54,597 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 87 [2018-01-30 00:12:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:54,597 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-01-30 00:12:54,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:12:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-01-30 00:12:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 00:12:54,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:54,598 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:54,599 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1819393368, now seen corresponding path program 3 times [2018-01-30 00:12:54,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:54,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:54,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:54,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:54,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:54,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:12:54,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:54,798 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:54,803 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:12:54,816 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:54,822 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:12:54,823 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:54,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:54,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:12:54,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:54,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:12:54,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:12:54,960 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-30 00:12:54,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:12:54,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:54,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:12:54,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-30 00:12:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-30 00:12:55,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:55,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-30 00:12:55,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:12:55,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:12:55,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-30 00:12:55,009 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 28 states. [2018-01-30 00:12:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:55,738 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-01-30 00:12:55,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:12:55,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-30 00:12:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:55,763 INFO L225 Difference]: With dead ends: 317 [2018-01-30 00:12:55,763 INFO L226 Difference]: Without dead ends: 207 [2018-01-30 00:12:55,765 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-30 00:12:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-30 00:12:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2018-01-30 00:12:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-30 00:12:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-30 00:12:55,779 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 93 [2018-01-30 00:12:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:55,779 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-30 00:12:55,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:12:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-30 00:12:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:12:55,780 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:55,781 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:55,781 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 676313695, now seen corresponding path program 1 times [2018-01-30 00:12:55,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:55,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:55,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:55,782 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:12:55,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:55,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:12:56,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:56,129 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:56,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:56,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:12:56,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:12:56,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-30 00:12:56,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:12:56,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:12:56,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:12:56,404 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 41 states. [2018-01-30 00:12:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:12:56,735 INFO L93 Difference]: Finished difference Result 311 states and 344 transitions. [2018-01-30 00:12:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:12:56,736 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-30 00:12:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:12:56,737 INFO L225 Difference]: With dead ends: 311 [2018-01-30 00:12:56,737 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:12:56,738 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 00:12:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:12:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-01-30 00:12:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-30 00:12:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2018-01-30 00:12:56,757 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 99 [2018-01-30 00:12:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:12:56,758 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2018-01-30 00:12:56,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 00:12:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2018-01-30 00:12:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:12:56,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:12:56,759 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:12:56,759 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:12:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash 160043413, now seen corresponding path program 2 times [2018-01-30 00:12:56,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:12:56,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:12:56,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:56,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:12:56,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:12:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:12:56,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:12:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-30 00:12:57,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:12:57,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:12:57,651 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:12:57,667 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:57,683 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:12:57,688 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:12:57,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:12:57,705 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 23 treesize of output 22 [2018-01-30 00:12:57,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,725 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 20 treesize of output 19 [2018-01-30 00:12:57,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,729 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 22 treesize of output 21 [2018-01-30 00:12:57,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,745 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 19 treesize of output 18 [2018-01-30 00:12:57,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:12:57,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:12:57,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:13:00,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-01-30 00:13:00,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:00,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-01-30 00:13:00,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:00,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,201 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 55 treesize of output 58 [2018-01-30 00:13:00,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:00,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:00,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:13:00,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:00,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-30 00:13:00,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-30 00:13:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:13:00,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:00,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-30 00:13:00,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-30 00:13:00,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-30 00:13:00,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2744, Unknown=3, NotChecked=0, Total=2970 [2018-01-30 00:13:00,515 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand 55 states. [2018-01-30 00:13:02,778 WARN L146 SmtUtils]: Spent 2086ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-01-30 00:13:11,007 WARN L146 SmtUtils]: Spent 8142ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-30 00:13:11,304 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-30 00:13:13,527 WARN L146 SmtUtils]: Spent 2063ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-30 00:13:15,934 WARN L146 SmtUtils]: Spent 2132ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-30 00:13:18,575 WARN L146 SmtUtils]: Spent 2096ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-01-30 00:13:20,866 WARN L146 SmtUtils]: Spent 2067ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-01-30 00:13:23,213 WARN L146 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 80 DAG size of output 71 [2018-01-30 00:13:23,390 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-30 00:13:24,046 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:13:24,580 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-30 00:14:03,162 WARN L146 SmtUtils]: Spent 28331ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-01-30 00:14:31,570 WARN L146 SmtUtils]: Spent 28302ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-01-30 00:14:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:32,340 INFO L93 Difference]: Finished difference Result 296 states and 323 transitions. [2018-01-30 00:14:32,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-30 00:14:32,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-30 00:14:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:32,342 INFO L225 Difference]: With dead ends: 296 [2018-01-30 00:14:32,342 INFO L226 Difference]: Without dead ends: 294 [2018-01-30 00:14:32,345 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=1498, Invalid=11152, Unknown=6, NotChecked=0, Total=12656 [2018-01-30 00:14:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-30 00:14:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 195. [2018-01-30 00:14:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:14:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-01-30 00:14:32,364 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 105 [2018-01-30 00:14:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:32,364 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-01-30 00:14:32,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-30 00:14:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-01-30 00:14:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 00:14:32,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:32,365 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:14:32,365 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:14:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 18432984, now seen corresponding path program 1 times [2018-01-30 00:14:32,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:32,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:32,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:32,366 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:14:32,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:32,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-30 00:14:32,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:14:32,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:14:32,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:14:32,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:14:32,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:14:32,428 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 4 states. [2018-01-30 00:14:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:32,570 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-01-30 00:14:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:14:32,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-30 00:14:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:32,571 INFO L225 Difference]: With dead ends: 253 [2018-01-30 00:14:32,572 INFO L226 Difference]: Without dead ends: 205 [2018-01-30 00:14:32,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-30 00:14:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-30 00:14:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2018-01-30 00:14:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-30 00:14:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-01-30 00:14:32,591 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 107 [2018-01-30 00:14:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:32,591 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-01-30 00:14:32,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:14:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-01-30 00:14:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-30 00:14:32,592 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:32,592 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:14:32,592 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:14:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1617005259, now seen corresponding path program 1 times [2018-01-30 00:14:32,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:32,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:32,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:32,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:32,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:32,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 00:14:33,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:33,086 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:14:33,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:33,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:33,131 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 14 treesize of output 13 [2018-01-30 00:14:33,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:33,142 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 17 treesize of output 16 [2018-01-30 00:14:33,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:33,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:14:33,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-30 00:14:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:14:35,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:35,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-30 00:14:35,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 00:14:35,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 00:14:35,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:14:35,512 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 48 states. [2018-01-30 00:14:37,811 WARN L143 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-30 00:14:45,611 WARN L143 SmtUtils]: Spent 5753ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-30 00:14:52,416 WARN L146 SmtUtils]: Spent 4080ms on a formula simplification. DAG size of input: 59 DAG size of output 48 [2018-01-30 00:14:58,703 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-30 00:15:02,836 WARN L146 SmtUtils]: Spent 4077ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-30 00:15:04,931 WARN L146 SmtUtils]: Spent 2057ms on a formula simplification. DAG size of input: 45 DAG size of output 44 Received shutdown request... [2018-01-30 00:15:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:15:07,064 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:15:07,071 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:15:07,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:15:07 BoogieIcfgContainer [2018-01-30 00:15:07,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:15:07,073 INFO L168 Benchmark]: Toolchain (without parser) took 149351.95 ms. Allocated memory was 308.3 MB in the beginning and 618.1 MB in the end (delta: 309.9 MB). Free memory was 267.3 MB in the beginning and 351.5 MB in the end (delta: -84.2 MB). Peak memory consumption was 225.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:07,075 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:15:07,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.57 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:07,075 INFO L168 Benchmark]: Boogie Preprocessor took 36.92 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 252.4 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-30 00:15:07,076 INFO L168 Benchmark]: RCFGBuilder took 345.18 ms. Allocated memory is still 308.3 MB. Free memory was 252.4 MB in the beginning and 227.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:07,076 INFO L168 Benchmark]: TraceAbstraction took 148741.95 ms. Allocated memory was 308.3 MB in the beginning and 618.1 MB in the end (delta: 309.9 MB). Free memory was 227.2 MB in the beginning and 351.5 MB in the end (delta: -124.3 MB). Peak memory consumption was 185.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:07,095 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.14 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.57 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.92 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 252.4 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 345.18 ms. Allocated memory is still 308.3 MB. Free memory was 252.4 MB in the beginning and 227.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 148741.95 ms. Allocated memory was 308.3 MB in the beginning and 618.1 MB in the end (delta: 309.9 MB). Free memory was 227.2 MB in the beginning and 351.5 MB in the end (delta: -124.3 MB). Peak memory consumption was 185.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 17 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 101 locations, 17 error locations. TIMEOUT Result, 148.6s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 133.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1768 SDtfs, 1919 SDslu, 14365 SDs, 0 SdLazy, 6791 SolverSat, 369 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1300 GetRequests, 712 SyntacticMatches, 5 SemanticMatches, 582 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8057 ImplicationChecksByTransitivity, 122.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=18, 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.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2043 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2013 ConstructedInterpolants, 201 QuantifiedInterpolants, 1713279 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 1451/3270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-15-07-110.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-15-07-110.csv Completed graceful shutdown