java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:23:09,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:23:09,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:23:09,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:23:09,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:23:09,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:23:09,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:23:09,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:23:09,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:23:09,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:23:09,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:23:09,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:23:09,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:23:09,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:23:09,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:23:09,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:23:09,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:23:09,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:23:09,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:23:09,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:23:09,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:23:09,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:23:09,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:23:09,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:23:09,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:23:09,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:23:09,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:23:09,280 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:23:09,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:23:09,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:23:09,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:23:09,281 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:23:09,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:23:09,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:23:09,292 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:23:09,292 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:23:09,292 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:23:09,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:23:09,293 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:23:09,294 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:23:09,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:23:09,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:23:09,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:23:09,295 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:23:09,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:23:09,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:23:09,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:23:09,341 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:23:09,344 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:23:09,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:23:09,345 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:23:09,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-02 09:23:09,498 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:23:09,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:23:09,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:23:09,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:23:09,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:23:09,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09, skipping insertion in model container [2018-02-02 09:23:09,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,518 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:23:09,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:23:09,634 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:23:09,647 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:23:09,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09 WrapperNode [2018-02-02 09:23:09,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:23:09,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:23:09,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:23:09,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:23:09,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... [2018-02-02 09:23:09,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:23:09,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:23:09,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:23:09,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:23:09,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:23:09,711 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:23:09,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:23:09,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:23:09,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:23:09,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:23:09,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:23:09,869 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:23:09,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:23:09 BoogieIcfgContainer [2018-02-02 09:23:09,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:23:09,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:23:09,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:23:09,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:23:09,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:23:09" (1/3) ... [2018-02-02 09:23:09,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5012f875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:23:09, skipping insertion in model container [2018-02-02 09:23:09,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:09" (2/3) ... [2018-02-02 09:23:09,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5012f875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:23:09, skipping insertion in model container [2018-02-02 09:23:09,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:23:09" (3/3) ... [2018-02-02 09:23:09,877 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-02 09:23:09,882 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:23:09,886 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 09:23:09,916 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:23:09,916 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:23:09,916 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:23:09,916 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:23:09,917 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:23:09,917 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:23:09,917 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:23:09,917 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:23:09,918 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:23:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-02 09:23:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:23:09,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:09,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:09,936 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-02 09:23:09,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:09,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:09,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:09,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:09,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:10,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:10,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:10,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:23:10,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:23:10,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:23:10,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:23:10,145 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-02 09:23:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:10,258 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-02 09:23:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:23:10,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 09:23:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:10,271 INFO L225 Difference]: With dead ends: 102 [2018-02-02 09:23:10,272 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:23:10,273 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-02 09:23:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:23:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-02 09:23:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:23:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-02 09:23:10,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-02 09:23:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:10,310 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-02 09:23:10,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:23:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-02 09:23:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:23:10,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:10,312 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:10,312 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-02 09:23:10,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:10,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:10,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:10,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:10,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:10,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:10,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:23:10,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:23:10,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:23:10,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:23:10,382 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-02 09:23:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:10,404 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-02 09:23:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:23:10,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:23:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:10,407 INFO L225 Difference]: With dead ends: 65 [2018-02-02 09:23:10,407 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 09:23:10,407 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-02 09:23:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 09:23:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-02 09:23:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:23:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 09:23:10,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-02 09:23:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:10,412 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 09:23:10,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:23:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 09:23:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:23:10,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:10,413 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-02 09:23:10,413 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-02 09:23:10,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:10,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:10,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:10,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:10,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:10,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:10,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:23:10,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:23:10,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:23:10,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:23:10,465 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-02 09:23:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:10,502 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-02 09:23:10,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:23:10,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:23:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:10,504 INFO L225 Difference]: With dead ends: 61 [2018-02-02 09:23:10,504 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 09:23:10,505 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-02 09:23:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 09:23:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 09:23:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:23:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 09:23:10,509 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-02 09:23:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:10,510 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 09:23:10,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:23:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 09:23:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:23:10,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:10,510 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-02 09:23:10,511 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-02 09:23:10,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:10,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:10,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:10,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:10,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:10,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:10,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:23:10,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:23:10,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:23:10,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:23:10,570 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-02 09:23:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:10,638 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-02 09:23:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:23:10,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:23:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:10,639 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:23:10,639 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:23:10,639 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-02 09:23:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:23:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 09:23:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:23:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 09:23:10,641 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-02 09:23:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:10,642 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 09:23:10,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:23:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 09:23:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:23:10,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:10,642 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-02 09:23:10,642 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-02 09:23:10,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:10,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:10,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:10,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:10,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:10,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:10,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:23:10,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:23:10,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:23:10,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:23:10,838 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-02 09:23:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:11,024 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 09:23:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:23:11,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 09:23:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:11,025 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:23:11,025 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:23:11,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:23:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:23:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-02 09:23:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:23:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 09:23:11,028 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-02 09:23:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:11,028 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 09:23:11,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:23:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 09:23:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:23:11,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:11,029 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:11,029 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-02 09:23:11,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:11,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:11,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:11,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:11,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:11,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:11,218 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-02 09:23:11,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:11,219 INFO L209 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-02 09:23:11,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:11,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:11,285 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-02 09:23:11,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:11,299 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-02 09:23:11,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:11,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:23:11,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 09:23:11,504 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-02 09:23:11,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:11,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 09:23:11,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:23:11,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:23:11,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:23:11,522 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-02-02 09:23:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:11,745 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 09:23:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:23:11,746 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-02 09:23:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:11,746 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:23:11,746 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 09:23:11,747 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-02 09:23:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 09:23:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-02-02 09:23:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:23:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 09:23:11,750 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-02-02 09:23:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:11,750 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 09:23:11,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:23:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 09:23:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:23:11,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:11,751 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-02 09:23:11,751 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-02 09:23:11,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:11,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:11,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:11,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:11,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:11,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:11,939 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-02 09:23:11,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:11,940 INFO L209 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-02 09:23:11,945 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:23:11,960 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:11,963 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:11,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:11,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:11,985 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-02 09:23:11,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:11,996 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-02 09:23:11,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:12,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:23:12,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 09:23:12,180 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-02 09:23:12,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:12,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-02 09:23:12,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:23:12,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:23:12,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:23:12,201 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 23 states. [2018-02-02 09:23:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,459 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-02 09:23:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:23:12,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-02 09:23:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,460 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:23:12,460 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:23:12,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:23:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:23:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-02 09:23:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 09:23:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-02 09:23:12,464 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 27 [2018-02-02 09:23:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,464 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-02 09:23:12,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:23:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-02 09:23:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:23:12,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,465 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] [2018-02-02 09:23:12,465 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737492, now seen corresponding path program 1 times [2018-02-02 09:23:12,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,466 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:12,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,503 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-02 09:23:12,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:12,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:23:12,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:23:12,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:23:12,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:23:12,507 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 4 states. [2018-02-02 09:23:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,554 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-02-02 09:23:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:23:12,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 09:23:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,555 INFO L225 Difference]: With dead ends: 90 [2018-02-02 09:23:12,555 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 09:23:12,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:23:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 09:23:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-02-02 09:23:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 09:23:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-02-02 09:23:12,560 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 35 [2018-02-02 09:23:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,561 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-02-02 09:23:12,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:23:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-02-02 09:23:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:23:12,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,562 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] [2018-02-02 09:23:12,562 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737491, now seen corresponding path program 1 times [2018-02-02 09:23:12,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 09:23:12,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:12,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:23:12,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:23:12,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:23:12,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:23:12,603 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 6 states. [2018-02-02 09:23:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,625 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-02-02 09:23:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:23:12,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 09:23:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,627 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:23:12,627 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:23:12,627 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-02 09:23:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:23:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 09:23:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 09:23:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-02-02 09:23:12,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 35 [2018-02-02 09:23:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,635 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2018-02-02 09:23:12,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:23:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-02-02 09:23:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:23:12,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,636 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-02 09:23:12,636 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1277044790, now seen corresponding path program 1 times [2018-02-02 09:23:12,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,681 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-02 09:23:12,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:12,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:23:12,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:23:12,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:23:12,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:23:12,682 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 5 states. [2018-02-02 09:23:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,693 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-02 09:23:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:23:12,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 09:23:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,695 INFO L225 Difference]: With dead ends: 84 [2018-02-02 09:23:12,695 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 09:23:12,695 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-02 09:23:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 09:23:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-02-02 09:23:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 09:23:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-02 09:23:12,699 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 38 [2018-02-02 09:23:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,699 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-02 09:23:12,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:23:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-02 09:23:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:23:12,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,700 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] [2018-02-02 09:23:12,700 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 1 times [2018-02-02 09:23:12,701 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,736 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-02 09:23:12,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:12,736 INFO L209 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-02 09:23:12,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:12,789 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-02 09:23:12,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:12,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-02 09:23:12,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:23:12,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:23:12,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:23:12,817 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 9 states. [2018-02-02 09:23:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,842 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-02 09:23:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:23:12,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-02 09:23:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,842 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:23:12,842 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:23:12,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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-02 09:23:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:23:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-02 09:23:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 09:23:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-02 09:23:12,845 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-02 09:23:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,845 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-02 09:23:12,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:23:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-02 09:23:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:23:12,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,846 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] [2018-02-02 09:23:12,846 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 2 times [2018-02-02 09:23:12,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,896 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-02 09:23:12,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:12,896 INFO L209 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-02 09:23:12,907 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:23:12,922 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:12,924 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:12,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 09:23:12,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:23:12,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-02 09:23:12,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:23:12,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:23:12,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:23:12,988 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 9 states. [2018-02-02 09:23:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:13,059 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-02 09:23:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:23:13,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-02 09:23:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:13,060 INFO L225 Difference]: With dead ends: 115 [2018-02-02 09:23:13,060 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:23:13,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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-02 09:23:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:23:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2018-02-02 09:23:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:23:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-02 09:23:13,065 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2018-02-02 09:23:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:13,065 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-02 09:23:13,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:23:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-02 09:23:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:23:13,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:13,066 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-02 09:23:13,066 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1262891178, now seen corresponding path program 1 times [2018-02-02 09:23:13,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:13,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:13,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:13,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:13,133 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-02 09:23:13,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:13,134 INFO L209 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-02 09:23:13,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:13,223 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-02 09:23:13,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:13,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 09:23:13,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:23:13,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:23:13,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:23:13,255 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states. [2018-02-02 09:23:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:13,322 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-02 09:23:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:23:13,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 09:23:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:13,323 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:23:13,323 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 09:23:13,323 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-02 09:23:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 09:23:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-02 09:23:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 09:23:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-02-02 09:23:13,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 48 [2018-02-02 09:23:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:13,325 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-02-02 09:23:13,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:23:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-02-02 09:23:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:23:13,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:13,326 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-02 09:23:13,326 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2016472243, now seen corresponding path program 2 times [2018-02-02 09:23:13,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:13,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:13,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:13,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:13,397 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-02 09:23:13,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:13,398 INFO L209 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-02 09:23:13,409 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:23:13,422 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:13,437 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:13,440 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:13,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:13,524 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-02 09:23:13,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:13,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 09:23:13,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:23:13,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:23:13,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:23:13,559 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 15 states. [2018-02-02 09:23:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:13,608 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-02 09:23:13,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:23:13,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 09:23:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:13,611 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:23:13,611 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:23:13,611 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-02 09:23:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:23:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-02 09:23:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:23:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 09:23:13,614 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 52 [2018-02-02 09:23:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:13,616 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 09:23:13,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:23:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 09:23:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:23:13,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:13,617 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-02 09:23:13,617 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:13,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2044492860, now seen corresponding path program 3 times [2018-02-02 09:23:13,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:13,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:13,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:13,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:13,707 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-02 09:23:13,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:13,707 INFO L209 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-02 09:23:13,712 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:23:13,720 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:23:13,724 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:23:13,725 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:13,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:13,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 23 treesize of output 22 [2018-02-02 09:23:13,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,764 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-02 09:23:13,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,765 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-02 09:23:13,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,779 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-02 09:23:13,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:23:13,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 09:23:13,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:13,974 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 35 treesize of output 38 [2018-02-02 09:23:13,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:13,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:13,996 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 34 treesize of output 28 [2018-02-02 09:23:13,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:14,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:14,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:14,014 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 37 treesize of output 50 [2018-02-02 09:23:14,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:14,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:14,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:14,033 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 36 treesize of output 30 [2018-02-02 09:23:14,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:14,054 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-02 09:23:14,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 09:23:14,103 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-02 09:23:14,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:14,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-02 09:23:14,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:23:14,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:23:14,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-02 09:23:14,121 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 21 states. [2018-02-02 09:23:36,658 WARN L143 SmtUtils]: Spent 14194ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-02 09:23:57,065 WARN L146 SmtUtils]: Spent 20359ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-02 09:23:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:57,337 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2018-02-02 09:23:57,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:23:57,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-02 09:23:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:57,338 INFO L225 Difference]: With dead ends: 161 [2018-02-02 09:23:57,338 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 09:23:57,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-02 09:23:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 09:23:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 114. [2018-02-02 09:23:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 09:23:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-02 09:23:57,343 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 56 [2018-02-02 09:23:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:57,343 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-02 09:23:57,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:23:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-02 09:23:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:23:57,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:57,344 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-02 09:23:57,344 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1800200380, now seen corresponding path program 1 times [2018-02-02 09:23:57,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:57,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:57,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,346 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:57,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:57,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:57,423 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-02 09:23:57,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:57,423 INFO L209 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-02 09:23:57,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:57,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:57,539 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-02 09:23:57,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:57,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 09:23:57,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:23:57,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:23:57,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:23:57,557 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 19 states. [2018-02-02 09:23:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:57,604 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-02-02 09:23:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:23:57,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 09:23:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:57,606 INFO L225 Difference]: With dead ends: 120 [2018-02-02 09:23:57,606 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 09:23:57,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:23:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 09:23:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 09:23:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 09:23:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-02-02 09:23:57,609 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 60 [2018-02-02 09:23:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:57,609 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-02-02 09:23:57,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:23:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-02-02 09:23:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 09:23:57,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:57,610 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-02 09:23:57,610 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1308562893, now seen corresponding path program 2 times [2018-02-02 09:23:57,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:57,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:57,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:57,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:57,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:57,683 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-02 09:23:57,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:57,683 INFO L209 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-02 09:23:57,688 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:23:57,697 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:57,705 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:57,706 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:57,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:57,778 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-02 09:23:57,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:57,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 09:23:57,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:23:57,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:23:57,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:23:57,795 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 21 states. [2018-02-02 09:23:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:57,840 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-02-02 09:23:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:23:57,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 09:23:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:57,841 INFO L225 Difference]: With dead ends: 124 [2018-02-02 09:23:57,841 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 09:23:57,841 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-02 09:23:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 09:23:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 09:23:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 09:23:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-02-02 09:23:57,843 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 64 [2018-02-02 09:23:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:57,843 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-02-02 09:23:57,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:23:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-02-02 09:23:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 09:23:57,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:57,844 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-02 09:23:57,844 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash -68509738, now seen corresponding path program 3 times [2018-02-02 09:23:57,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:57,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:57,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:57,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:57,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:57,944 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-02 09:23:57,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:57,945 INFO L209 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-02 09:23:57,950 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:23:57,957 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:23:57,960 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:23:57,961 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:57,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:57,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:23:57,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:57,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:23:57,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:23:58,008 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-02 09:23:58,012 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-02 09:23:58,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:58,015 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-02 09:23:58,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-02 09:23:58,025 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-02 09:23:58,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:58,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-02-02 09:23:58,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:23:58,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:23:58,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420 [2018-02-02 09:23:58,042 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 21 states. [2018-02-02 09:23:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:58,317 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-02-02 09:23:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:23:58,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-02-02 09:23:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:58,318 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:23:58,318 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:23:58,319 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-02 09:23:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:23:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2018-02-02 09:23:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 09:23:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-02 09:23:58,321 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 68 [2018-02-02 09:23:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:58,321 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-02 09:23:58,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:23:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-02 09:23:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:23:58,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:58,322 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-02 09:23:58,322 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-02-02 09:23:58,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:58,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:58,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:58,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:58,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:58,348 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-02 09:23:58,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:58,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:23:58,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:23:58,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:23:58,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:23:58,349 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-02-02 09:23:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:58,366 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-02 09:23:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:23:58,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 09:23:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:58,367 INFO L225 Difference]: With dead ends: 120 [2018-02-02 09:23:58,367 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 09:23:58,367 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-02 09:23:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 09:23:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-02-02 09:23:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 09:23:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-02 09:23:58,370 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-02-02 09:23:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:58,370 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-02 09:23:58,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:23:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-02 09:23:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 09:23:58,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:58,370 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] [2018-02-02 09:23:58,370 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-02-02 09:23:58,371 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:58,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:58,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:58,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:58,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 09:23:58,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:58,526 INFO L209 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-02 09:23:58,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:58,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 09:23:58,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:58,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-02 09:23:58,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:23:58,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:23:58,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-02 09:23:58,671 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 13 states. [2018-02-02 09:23:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:58,857 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 09:23:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:23:58,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-02-02 09:23:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:58,857 INFO L225 Difference]: With dead ends: 125 [2018-02-02 09:23:58,858 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:23:58,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-02 09:23:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:23:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 09:23:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 09:23:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-02-02 09:23:58,860 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-02-02 09:23:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:58,860 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-02-02 09:23:58,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:23:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-02-02 09:23:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:23:58,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:58,861 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:58,861 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-02-02 09:23:58,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:58,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:58,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:58,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:58,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 09:23:58,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:58,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:23:58,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:23:58,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:23:58,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:23:58,917 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-02-02 09:23:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:58,931 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 09:23:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:23:58,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-02 09:23:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:58,932 INFO L225 Difference]: With dead ends: 111 [2018-02-02 09:23:58,932 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 09:23:58,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:23:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 09:23:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 09:23:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 09:23:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 09:23:58,935 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-02-02 09:23:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:58,935 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 09:23:58,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:23:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 09:23:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 09:23:58,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:58,936 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:58,936 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-02-02 09:23:58,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:58,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:58,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:58,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:58,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 09:23:59,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:59,004 INFO L209 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-02 09:23:59,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:59,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 09:23:59,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:59,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-02 09:23:59,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:23:59,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:23:59,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:23:59,083 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 8 states. [2018-02-02 09:23:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:59,110 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-02-02 09:23:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:23:59,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-02-02 09:23:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:59,112 INFO L225 Difference]: With dead ends: 144 [2018-02-02 09:23:59,112 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:23:59,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:23:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:23:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-02-02 09:23:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 09:23:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-02 09:23:59,114 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-02-02 09:23:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:59,114 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-02 09:23:59,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:23:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-02 09:23:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 09:23:59,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:59,115 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:23:59,115 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:23:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-02-02 09:23:59,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:59,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:59,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:59,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:59,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:59,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 09:23:59,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:59,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:23:59,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:59,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:59,507 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-02 09:23:59,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:59,509 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-02 09:23:59,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:59,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-02-02 09:23:59,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:59,536 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-02 09:23:59,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:59,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:23:59,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-02-02 09:24:00,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-02-02 09:24:00,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:00,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-02-02 09:24:00,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:00,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 09:24:00,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:00,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-02-02 09:24:00,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:00,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-02-02 09:24:00,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-02-02 09:24:00,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:00,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,000 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 71 treesize of output 65 [2018-02-02 09:24:01,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:01,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,091 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 69 treesize of output 63 [2018-02-02 09:24:01,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:01,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 100 [2018-02-02 09:24:01,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:24:01,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,528 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 64 treesize of output 58 [2018-02-02 09:24:01,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:01,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 72 treesize of output 66 [2018-02-02 09:24:01,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:01,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-02-02 09:24:01,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 09:24:01,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:01,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-02-02 09:24:01,831 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 09:24:02,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,030 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 62 treesize of output 56 [2018-02-02 09:24:02,030 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:02,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 70 treesize of output 64 [2018-02-02 09:24:02,035 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:24:02,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:24:02,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-02-02 09:24:02,188 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-02 09:24:02,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-02-02 09:24:02,397 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-02-02 09:24:03,943 WARN L146 SmtUtils]: Spent 1255ms on a formula simplification. DAG size of input: 240 DAG size of output 61 [2018-02-02 09:24:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 76 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:24:03,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:24:03,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 41 [2018-02-02 09:24:03,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 09:24:03,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 09:24:03,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1567, Unknown=8, NotChecked=0, Total=1722 [2018-02-02 09:24:03,998 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 42 states. [2018-02-02 09:24:06,146 WARN L146 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-02 09:24:06,440 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-02-02 09:24:08,537 WARN L146 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-02-02 09:24:12,736 WARN L146 SmtUtils]: Spent 4052ms on a formula simplification. DAG size of input: 58 DAG size of output 53 Received shutdown request... [2018-02-02 09:24:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:24:23,671 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:24:23,674 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:24:23,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:24:23 BoogieIcfgContainer [2018-02-02 09:24:23,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:24:23,675 INFO L168 Benchmark]: Toolchain (without parser) took 74177.27 ms. Allocated memory was 395.8 MB in the beginning and 792.7 MB in the end (delta: 396.9 MB). Free memory was 352.7 MB in the beginning and 422.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 327.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:24:23,676 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:24:23,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.22 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 339.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:24:23,676 INFO L168 Benchmark]: Boogie Preprocessor took 22.54 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 338.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:24:23,676 INFO L168 Benchmark]: RCFGBuilder took 193.69 ms. Allocated memory is still 395.8 MB. Free memory was 338.2 MB in the beginning and 316.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:24:23,677 INFO L168 Benchmark]: TraceAbstraction took 73803.78 ms. Allocated memory was 395.8 MB in the beginning and 792.7 MB in the end (delta: 396.9 MB). Free memory was 316.1 MB in the beginning and 422.5 MB in the end (delta: -106.4 MB). Peak memory consumption was 290.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:24:23,677 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.12 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.22 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 339.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.54 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 338.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.69 ms. Allocated memory is still 395.8 MB. Free memory was 338.2 MB in the beginning and 316.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73803.78 ms. Allocated memory was 395.8 MB in the beginning and 792.7 MB in the end (delta: 396.9 MB). Free memory was 316.1 MB in the beginning and 422.5 MB in the end (delta: -106.4 MB). Peak memory consumption was 290.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 32 states, 42 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 73.7s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 64.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1248 SDtfs, 954 SDslu, 6729 SDs, 0 SdLazy, 3751 SolverSat, 201 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1006 GetRequests, 662 SyntacticMatches, 8 SemanticMatches, 335 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 51.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=17, 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, 22 MinimizatonAttempts, 203 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1806 NumberOfCodeBlocks, 1734 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1770 ConstructedInterpolants, 89 QuantifiedInterpolants, 885224 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2252 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 1945/2944 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_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-24-23-682.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-24-23-682.csv Completed graceful shutdown