java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:01:09,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:01:09,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:01:09,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:01:09,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:01:09,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:01:09,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:01:09,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:01:09,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:01:09,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:01:09,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:01:09,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:01:09,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:01:09,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:01:09,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:01:09,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:01:09,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:01:09,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:01:09,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:01:09,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:01:09,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:01:09,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:01:09,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:01:09,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:01:09,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:01:09,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:01:09,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:01:09,903 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:01:09,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:01:09,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:01:09,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:01:09,904 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 14:01:09,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:01:09,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:01:09,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:01:09,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:01:09,915 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:01:09,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:01:09,916 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:01:09,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:01:09,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:01:09,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:01:09,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:01:09,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:01:09,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:01:09,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:01:09,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:01:09,918 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:01:09,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:01:09,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:01:09,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:01:09,955 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:01:09,959 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:01:09,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:01:09,961 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:01:09,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 14:01:10,131 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:01:10,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:01:10,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:01:10,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:01:10,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:01:10,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19736028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10, skipping insertion in model container [2018-02-04 14:01:10,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,156 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:01:10,194 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:01:10,289 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:01:10,305 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:01:10,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10 WrapperNode [2018-02-04 14:01:10,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:01:10,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:01:10,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:01:10,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:01:10,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... [2018-02-04 14:01:10,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:01:10,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:01:10,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:01:10,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:01:10,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:01:10,382 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 14:01:10,383 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:01:10,383 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:01:10,383 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:01:10,383 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:01:10,383 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:01:10,384 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:01:10,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:01:10,569 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:01:10,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:01:10 BoogieIcfgContainer [2018-02-04 14:01:10,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:01:10,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:01:10,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:01:10,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:01:10,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:01:10" (1/3) ... [2018-02-04 14:01:10,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d7ef5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:01:10, skipping insertion in model container [2018-02-04 14:01:10,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:10" (2/3) ... [2018-02-04 14:01:10,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d7ef5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:01:10, skipping insertion in model container [2018-02-04 14:01:10,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:01:10" (3/3) ... [2018-02-04 14:01:10,575 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 14:01:10,582 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:01:10,589 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 14:01:10,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:01:10,614 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:01:10,614 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:01:10,614 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:01:10,614 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:01:10,614 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:01:10,614 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:01:10,614 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:01:10,615 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:01:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 14:01:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:01:10,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:10,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:10,632 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-02-04 14:01:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-04 14:01:10,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:10,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:10,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:10,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:10,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:10,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:10,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:10,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:01:10,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:01:10,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:01:10,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:01:10,890 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-04 14:01:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:10,943 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-04 14:01:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:01:10,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 14:01:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:10,952 INFO L225 Difference]: With dead ends: 82 [2018-02-04 14:01:10,952 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 14:01:10,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:01:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 14:01:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 14:01:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 14:01:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 14:01:10,987 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-04 14:01:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:10,988 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 14:01:10,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:01:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 14:01:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 14:01:10,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:10,990 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:10,990 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-02-04 14:01:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-04 14:01:10,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:10,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:10,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:10,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:10,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:11,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:11,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:11,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:01:11,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:01:11,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:01:11,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:01:11,040 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-04 14:01:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:11,112 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 14:01:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:01:11,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 14:01:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:11,114 INFO L225 Difference]: With dead ends: 112 [2018-02-04 14:01:11,114 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 14:01:11,114 INFO L554 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-02-04 14:01:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 14:01:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-04 14:01:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 14:01:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 14:01:11,119 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-04 14:01:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:11,120 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 14:01:11,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:01:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 14:01:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:01:11,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:11,121 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:11,121 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-02-04 14:01:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-04 14:01:11,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:11,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:11,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:11,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:11,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:11,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:11,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:01:11,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:01:11,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:01:11,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:01:11,194 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-04 14:01:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:11,317 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 14:01:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:01:11,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 14:01:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:11,318 INFO L225 Difference]: With dead ends: 76 [2018-02-04 14:01:11,319 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 14:01:11,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:01:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 14:01:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-04 14:01:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 14:01:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 14:01:11,325 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-04 14:01:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:11,325 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 14:01:11,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:01:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 14:01:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:01:11,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:11,326 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:11,326 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-02-04 14:01:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-04 14:01:11,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:11,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:11,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:11,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:11,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:11,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:11,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:01:11,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:01:11,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:01:11,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:01:11,525 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 14:01:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:11,790 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 14:01:11,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:01:11,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 14:01:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:11,791 INFO L225 Difference]: With dead ends: 80 [2018-02-04 14:01:11,791 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 14:01:11,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:01:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 14:01:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 14:01:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 14:01:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 14:01:11,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-04 14:01:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:11,797 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 14:01:11,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:01:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 14:01:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:01:11,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:11,798 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:11,798 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-02-04 14:01:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-04 14:01:11,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:11,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:11,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,800 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:11,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:11,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:11,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:11,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:01:11,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:01:11,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:01:11,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:01:11,841 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-04 14:01:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:11,866 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 14:01:11,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:01:11,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 14:01:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:11,868 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:01:11,868 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 14:01:11,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:01:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 14:01:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 14:01:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 14:01:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 14:01:11,873 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-04 14:01:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:11,873 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 14:01:11,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:01:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 14:01:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:01:11,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:11,874 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:11,874 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-02-04 14:01:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-04 14:01:11,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:11,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:11,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:11,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:11,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:12,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:12,065 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:12,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:12,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:12,181 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-02-04 14:01:12,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:12,194 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-02-04 14:01:12,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:12,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:01:12,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 14:01:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:12,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:12,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 14:01:12,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 14:01:12,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 14:01:12,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:01:12,480 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-02-04 14:01:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:12,702 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 14:01:12,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:01:12,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-04 14:01:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:12,703 INFO L225 Difference]: With dead ends: 82 [2018-02-04 14:01:12,703 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 14:01:12,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:01:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 14:01:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-02-04 14:01:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 14:01:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 14:01:12,707 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-02-04 14:01:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:12,707 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 14:01:12,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 14:01:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 14:01:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 14:01:12,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:12,707 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:12,707 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-02-04 14:01:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-04 14:01:12,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:12,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:12,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:12,709 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:12,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:12,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:12,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:12,885 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:12,892 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:01:12,905 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 14:01:12,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:01:12,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:12,934 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-02-04 14:01:12,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:12,953 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-02-04 14:01:12,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:12,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:01:12,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 14:01:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:13,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:13,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 14:01:13,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 14:01:13,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 14:01:13,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:01:13,202 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2018-02-04 14:01:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:13,470 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 14:01:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:01:13,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 14:01:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:13,471 INFO L225 Difference]: With dead ends: 81 [2018-02-04 14:01:13,471 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 14:01:13,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 14:01:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 14:01:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 14:01:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 14:01:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 14:01:13,477 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-02-04 14:01:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:13,478 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 14:01:13,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 14:01:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 14:01:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 14:01:13,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:13,479 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 14:01:13,479 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-02-04 14:01:13,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times [2018-02-04 14:01:13,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:13,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:13,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,481 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:01:13,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:13,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 14:01:13,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:13,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:01:13,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:01:13,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:01:13,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:01:13,527 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 14:01:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:13,539 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 14:01:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:01:13,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 14:01:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:13,541 INFO L225 Difference]: With dead ends: 83 [2018-02-04 14:01:13,541 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 14:01:13,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:01:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 14:01:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 14:01:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 14:01:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 14:01:13,544 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-02-04 14:01:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:13,545 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 14:01:13,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:01:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 14:01:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:01:13,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:13,546 INFO L351 BasicCegarLoop]: trace histogram [3, 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-02-04 14:01:13,546 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-02-04 14:01:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times [2018-02-04 14:01:13,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:13,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:13,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:13,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:13,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:01:13,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:01:13,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:01:13,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:01:13,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:01:13,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:01:13,596 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-04 14:01:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:13,718 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-04 14:01:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:01:13,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 14:01:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:13,720 INFO L225 Difference]: With dead ends: 123 [2018-02-04 14:01:13,720 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 14:01:13,720 INFO L554 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-02-04 14:01:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 14:01:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-02-04 14:01:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 14:01:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-04 14:01:13,725 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39 [2018-02-04 14:01:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:13,726 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-04 14:01:13,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:01:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-04 14:01:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:01:13,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:13,727 INFO L351 BasicCegarLoop]: trace histogram [3, 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-02-04 14:01:13,727 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-02-04 14:01:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times [2018-02-04 14:01:13,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:13,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:13,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:13,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:13,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:13,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:13,785 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:13,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:13,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:13,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:13,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 14:01:13,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:01:13,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:01:13,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:01:13,863 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2018-02-04 14:01:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:13,883 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 14:01:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:01:13,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 14:01:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:13,886 INFO L225 Difference]: With dead ends: 112 [2018-02-04 14:01:13,886 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 14:01:13,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:01:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 14:01:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 14:01:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 14:01:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-04 14:01:13,891 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-04 14:01:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:13,892 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-04 14:01:13,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:01:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-04 14:01:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 14:01:13,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:13,893 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:01:13,893 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-02-04 14:01:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times [2018-02-04 14:01:13,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:13,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:13,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:13,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:13,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:13,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:13,936 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:13,944 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:01:13,960 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 14:01:13,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:01:13,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 14:01:14,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:01:14,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 14:01:14,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:01:14,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:01:14,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:01:14,005 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states. [2018-02-04 14:01:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:14,097 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 14:01:14,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:01:14,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 14:01:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:14,098 INFO L225 Difference]: With dead ends: 141 [2018-02-04 14:01:14,098 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 14:01:14,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:01:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 14:01:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-02-04 14:01:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 14:01:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 14:01:14,101 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2018-02-04 14:01:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:14,102 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 14:01:14,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:01:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 14:01:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:01:14,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:14,103 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-02-04 14:01:14,103 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-02-04 14:01:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times [2018-02-04 14:01:14,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:14,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:14,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,104 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:01:14,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:14,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:01:14,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:14,161 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:14,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:14,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:14,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:14,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 14:01:14,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:01:14,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:01:14,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:01:14,253 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states. [2018-02-04 14:01:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:14,296 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-02-04 14:01:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:01:14,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 14:01:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:14,297 INFO L225 Difference]: With dead ends: 119 [2018-02-04 14:01:14,297 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 14:01:14,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:01:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 14:01:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 14:01:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 14:01:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 14:01:14,301 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48 [2018-02-04 14:01:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:14,301 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 14:01:14,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:01:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 14:01:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:01:14,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:14,302 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2018-02-04 14:01:14,303 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-02-04 14:01:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times [2018-02-04 14:01:14,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:14,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:14,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:01:14,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:14,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:01:14,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:14,374 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:14,382 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:01:14,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 14:01:14,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:01:14,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:01:14,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:14,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 14:01:14,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:01:14,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:01:14,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:01:14,496 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 14:01:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:01:14,557 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-02-04 14:01:14,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:01:14,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 14:01:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:01:14,559 INFO L225 Difference]: With dead ends: 123 [2018-02-04 14:01:14,559 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 14:01:14,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:01:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 14:01:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-04 14:01:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 14:01:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-02-04 14:01:14,562 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52 [2018-02-04 14:01:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:01:14,566 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-02-04 14:01:14,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:01:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-02-04 14:01:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 14:01:14,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:01:14,567 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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] [2018-02-04 14:01:14,567 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-02-04 14:01:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times [2018-02-04 14:01:14,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:01:14,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:01:14,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,568 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:01:14,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:01:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:01:14,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:01:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:01:14,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:01:14,648 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:01:14,663 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 14:01:14,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 14:01:14,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:01:14,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:01:14,720 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 26 treesize of output 25 [2018-02-04 14:01:14,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:14,734 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-02-04 14:01:14,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:14,747 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-02-04 14:01:14,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:14,749 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 25 treesize of output 24 [2018-02-04 14:01:14,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:14,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:01:14,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 14:01:14,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:01:14,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:01:14,960 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 35 treesize of output 29 [2018-02-04 14:01:14,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:14,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:01:14,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:01:14,980 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 37 treesize of output 31 [2018-02-04 14:01:14,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:15,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:01:15,010 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 31 treesize of output 40 [2018-02-04 14:01:15,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:15,030 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 29 treesize of output 28 [2018-02-04 14:01:15,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:01:15,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 14:01:15,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 14:01:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 14:01:15,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:01:15,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 14:01:15,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 14:01:15,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 14:01:15,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 14:01:15,122 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states. [2018-02-04 14:01:37,439 WARN L143 SmtUtils]: Spent 14234ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 14:02:00,024 WARN L146 SmtUtils]: Spent 22539ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 14:02:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:00,295 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2018-02-04 14:02:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 14:02:00,296 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 14:02:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:00,296 INFO L225 Difference]: With dead ends: 197 [2018-02-04 14:02:00,296 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 14:02:00,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 14:02:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 14:02:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-02-04 14:02:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 14:02:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 14:02:00,300 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56 [2018-02-04 14:02:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:00,300 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 14:02:00,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 14:02:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 14:02:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 14:02:00,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:00,301 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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] [2018-02-04 14:02:00,301 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-02-04 14:02:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times [2018-02-04 14:02:00,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:00,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:00,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,303 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:02:00,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:00,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:02:00,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:02:00,368 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:02:00,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:00,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:02:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:02:00,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:02:00,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 14:02:00,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 14:02:00,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 14:02:00,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:02:00,488 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states. [2018-02-04 14:02:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:00,546 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 14:02:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:02:00,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 14:02:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:00,548 INFO L225 Difference]: With dead ends: 146 [2018-02-04 14:02:00,548 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 14:02:00,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:02:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 14:02:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 14:02:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 14:02:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 14:02:00,553 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60 [2018-02-04 14:02:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:00,553 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 14:02:00,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 14:02:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 14:02:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 14:02:00,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:00,554 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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] [2018-02-04 14:02:00,554 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-02-04 14:02:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times [2018-02-04 14:02:00,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:00,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:00,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:00,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:00,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:02:00,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:02:00,652 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:02:00,661 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 14:02:00,685 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 14:02:00,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:02:00,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:02:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:02:00,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:02:00,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 14:02:00,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 14:02:00,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 14:02:00,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:02:00,817 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states. [2018-02-04 14:02:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:00,867 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-04 14:02:00,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:02:00,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 14:02:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:00,874 INFO L225 Difference]: With dead ends: 150 [2018-02-04 14:02:00,874 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 14:02:00,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:02:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 14:02:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 14:02:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 14:02:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-04 14:02:00,878 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64 [2018-02-04 14:02:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:00,879 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-04 14:02:00,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 14:02:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-04 14:02:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 14:02:00,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:00,880 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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] [2018-02-04 14:02:00,880 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-02-04 14:02:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times [2018-02-04 14:02:00,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:00,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:00,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,881 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:02:00,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:00,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:02:00,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:02:00,976 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:02:00,981 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 14:02:01,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 14:02:01,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 14:02:01,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:02:01,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 14:02:01,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:01,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:01,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:02:01,065 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-02-04 14:02:01,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 14:02:01,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:01,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:01,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 14:02:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-02-04 14:02:01,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:02:01,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-02-04 14:02:01,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 14:02:01,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 14:02:01,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420 [2018-02-04 14:02:01,106 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 21 states. [2018-02-04 14:02:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:01,435 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2018-02-04 14:02:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 14:02:01,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-02-04 14:02:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:01,468 INFO L225 Difference]: With dead ends: 175 [2018-02-04 14:02:01,468 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 14:02:01,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=1138, Unknown=2, NotChecked=72, Total=1482 [2018-02-04 14:02:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 14:02:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2018-02-04 14:02:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 14:02:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-04 14:02:01,471 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68 [2018-02-04 14:02:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:01,471 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-04 14:02:01,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 14:02:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-04 14:02:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 14:02:01,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:01,472 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 14:02:01,472 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-02-04 14:02:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-04 14:02:01,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:01,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:01,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:01,472 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 14:02:01,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:01,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 14:02:01,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:02:01,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:02:01,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:02:01,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:02:01,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:02:01,502 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-04 14:02:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:01,521 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 14:02:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:02:01,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 14:02:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:01,522 INFO L225 Difference]: With dead ends: 155 [2018-02-04 14:02:01,522 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 14:02:01,522 INFO L554 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-02-04 14:02:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 14:02:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-04 14:02:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 14:02:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-04 14:02:01,525 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-04 14:02:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:01,525 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-04 14:02:01,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:02:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-04 14:02:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 14:02:01,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:01,526 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 14:02:01,526 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-02-04 14:02:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-04 14:02:01,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:01,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:01,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:01,527 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:01,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:01,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 14:02:01,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:02:01,707 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:02:01,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:01,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:02:01,757 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-02-04 14:02:01,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:01,769 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-02-04 14:02:01,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:01,803 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-02-04 14:02:01,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 14:02:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:02:09,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:02:09,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-04 14:02:09,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 14:02:09,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 14:02:09,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=815, Unknown=3, NotChecked=0, Total=930 [2018-02-04 14:02:09,577 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 31 states. [2018-02-04 14:02:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:02:42,727 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-04 14:02:42,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 14:02:42,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-04 14:02:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:02:42,728 INFO L225 Difference]: With dead ends: 170 [2018-02-04 14:02:42,728 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 14:02:42,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=544, Invalid=2991, Unknown=5, NotChecked=0, Total=3540 [2018-02-04 14:02:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 14:02:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2018-02-04 14:02:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 14:02:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-04 14:02:42,732 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-04 14:02:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:02:42,732 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-04 14:02:42,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 14:02:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-04 14:02:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 14:02:42,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:02:42,732 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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-02-04 14:02:42,732 INFO L371 AbstractCegarLoop]: === Iteration 20 === [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-02-04 14:02:42,732 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-04 14:02:42,733 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:02:42,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:02:42,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:42,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:42,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:02:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:42,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:02:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:02:43,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:02:43,550 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:02:43,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:02:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:02:43,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:02:43,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 14:02:43,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 14:02:43,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-04 14:02:43,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 14:02:43,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,664 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 18 treesize of output 27 [2018-02-04 14:02:43,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 14:02:43,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-04 14:02:43,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-02-04 14:02:43,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 14:02:43,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-04 14:02:43,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-04 14:02:43,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:43,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 14:02:43,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-04 14:02:43,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:43,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-02-04 14:02:43,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:43,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:43,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 14:02:44,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-02-04 14:02:44,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-02-04 14:02:44,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:44,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-04 14:02:44,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-02-04 14:02:44,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-02-04 14:02:44,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:44,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-04 14:02:44,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-02-04 14:02:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:44,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-02-04 14:02:44,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:44,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:44,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-04 14:02:44,907 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 14:02:45,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-02-04 14:02:45,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:45,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-02-04 14:02:45,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:46,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:46,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:46,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-04 14:02:57,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2018-02-04 14:02:57,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:02:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 591 [2018-02-04 14:02:57,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:02:57,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:02:57,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 14:02:57,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 [2018-02-04 14:03:25,970 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 14:03:28,109 WARN L143 SmtUtils]: Spent 2073ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 14:03:30,207 WARN L143 SmtUtils]: Spent 2044ms on a formula simplification that was a NOOP. DAG size: 65 [2018-02-04 14:03:30,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-02-04 14:03:30,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:03:30,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 324 [2018-02-04 14:03:30,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:03:30,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:03:30,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:03:30,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:132, output treesize:3 [2018-02-04 14:03:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 105 proven. 97 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:03:30,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:03:30,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-02-04 14:03:30,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 14:03:30,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 14:03:30,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1853, Unknown=18, NotChecked=0, Total=2256 [2018-02-04 14:03:30,368 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 48 states. [2018-02-04 14:04:14,789 WARN L146 SmtUtils]: Spent 752ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-02-04 14:04:22,080 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 72 DAG size of output 61 Received shutdown request... [2018-02-04 14:04:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 14:04:52,043 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 14:04:52,046 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 14:04:52,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:04:52 BoogieIcfgContainer [2018-02-04 14:04:52,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:04:52,047 INFO L168 Benchmark]: Toolchain (without parser) took 221915.41 ms. Allocated memory was 406.3 MB in the beginning and 725.6 MB in the end (delta: 319.3 MB). Free memory was 363.0 MB in the beginning and 586.0 MB in the end (delta: -223.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:04:52,048 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 406.3 MB. Free memory is still 368.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:04:52,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.29 ms. Allocated memory is still 406.3 MB. Free memory was 363.0 MB in the beginning and 349.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:04:52,048 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 406.3 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:04:52,048 INFO L168 Benchmark]: RCFGBuilder took 227.56 ms. Allocated memory is still 406.3 MB. Free memory was 347.1 MB in the beginning and 321.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:04:52,048 INFO L168 Benchmark]: TraceAbstraction took 221476.56 ms. Allocated memory was 406.3 MB in the beginning and 725.6 MB in the end (delta: 319.3 MB). Free memory was 321.9 MB in the beginning and 586.0 MB in the end (delta: -264.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 5.3 GB. [2018-02-04 14:04:52,049 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.21 ms. Allocated memory is still 406.3 MB. Free memory is still 368.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.29 ms. Allocated memory is still 406.3 MB. Free memory was 363.0 MB in the beginning and 349.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 406.3 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 227.56 ms. Allocated memory is still 406.3 MB. Free memory was 347.1 MB in the beginning and 321.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 221476.56 ms. Allocated memory was 406.3 MB in the beginning and 725.6 MB in the end (delta: 319.3 MB). Free memory was 321.9 MB in the beginning and 586.0 MB in the end (delta: -264.1 MB). Peak memory consumption was 55.1 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 221.4s OverallTime, 20 OverallIterations, 11 TraceHistogramMax, 161.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1362 SDtfs, 1106 SDslu, 7928 SDs, 0 SdLazy, 4720 SolverSat, 270 SolverUnsat, 54 SolverUnknown, 0 SolverNotchecked, 76.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 558 SyntacticMatches, 15 SemanticMatches, 366 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 137.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 203 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 58.2s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1495 ConstructedInterpolants, 109 QuantifiedInterpolants, 946508 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2020 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 1116/2274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-04-52-056.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-04-52-056.csv Completed graceful shutdown