java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:42:21,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:42:21,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:42:21,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:42:21,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:42:21,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:42:21,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:42:21,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:42:21,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:42:21,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:42:21,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:42:21,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:42:21,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:42:21,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:42:21,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:42:21,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:42:21,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:42:21,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:42:21,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:42:21,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:42:21,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:42:21,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:42:21,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:42:21,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:42:21,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:42:21,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:42:21,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:42:21,936 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:42:21,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:42:21,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:42:21,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:42:21,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:42:21,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:42:21,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:42:21,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:42:21,958 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:42:21,959 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:42:21,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:42:21,959 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:42:21,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:42:21,960 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:42:21,960 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:42:21,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:42:21,964 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:42:21,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:42:21,964 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:42:21,965 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:42:21,965 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:42:21,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:42:21,965 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:42:21,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:42:21,966 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:42:21,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:42:21,966 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:42:21,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:42:21,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:42:21,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:42:21,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:42:21,968 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:42:21,970 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:42:21,970 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:42:22,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:42:22,035 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:42:22,039 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:42:22,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:42:22,040 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:42:22,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-31 08:42:22,246 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:42:22,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:42:22,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:42:22,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:42:22,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:42:22,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573beb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22, skipping insertion in model container [2018-01-31 08:42:22,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,285 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:42:22,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:42:22,552 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:42:22,582 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:42:22,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22 WrapperNode [2018-01-31 08:42:22,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:42:22,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:42:22,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:42:22,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:42:22,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... [2018-01-31 08:42:22,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:42:22,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:42:22,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:42:22,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:42:22,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:42:22,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:42:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:42:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:42:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:42:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:42:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-31 08:42:22,713 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-31 08:42:22,713 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:42:22,713 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:42:22,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:42:22,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:42:23,360 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:42:23,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:42:23 BoogieIcfgContainer [2018-01-31 08:42:23,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:42:23,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:42:23,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:42:23,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:42:23,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:42:22" (1/3) ... [2018-01-31 08:42:23,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e1d604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:42:23, skipping insertion in model container [2018-01-31 08:42:23,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:22" (2/3) ... [2018-01-31 08:42:23,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e1d604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:42:23, skipping insertion in model container [2018-01-31 08:42:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:42:23" (3/3) ... [2018-01-31 08:42:23,391 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-31 08:42:23,399 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:42:23,408 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:42:23,456 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:42:23,456 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:42:23,456 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:42:23,456 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:42:23,456 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:42:23,456 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:42:23,456 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:42:23,457 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:42:23,457 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:42:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-31 08:42:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:42:23,491 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:23,494 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:23,494 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 215684190, now seen corresponding path program 1 times [2018-01-31 08:42:23,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:23,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:23,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:23,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:23,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:23,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:23,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:23,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:42:23,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:42:23,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:42:23,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:42:23,849 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-01-31 08:42:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:24,255 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2018-01-31 08:42:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:42:24,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-31 08:42:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:24,271 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:42:24,272 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:42:24,276 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-01-31 08:42:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:42:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2018-01-31 08:42:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 08:42:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-01-31 08:42:24,340 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 23 [2018-01-31 08:42:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:24,341 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-01-31 08:42:24,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:42:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-01-31 08:42:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:42:24,343 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:24,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:24,343 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1826645950, now seen corresponding path program 1 times [2018-01-31 08:42:24,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:24,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:24,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:24,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:24,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:24,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:24,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:42:24,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:24,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:24,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:24,481 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-01-31 08:42:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:24,702 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-01-31 08:42:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:42:24,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:42:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:24,707 INFO L225 Difference]: With dead ends: 143 [2018-01-31 08:42:24,707 INFO L226 Difference]: Without dead ends: 139 [2018-01-31 08:42:24,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:42:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-31 08:42:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-01-31 08:42:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 08:42:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2018-01-31 08:42:24,729 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 24 [2018-01-31 08:42:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:24,729 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2018-01-31 08:42:24,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-01-31 08:42:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:42:24,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:24,731 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:24,731 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:24,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1903533239, now seen corresponding path program 1 times [2018-01-31 08:42:24,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:24,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:24,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:24,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:24,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:24,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:24,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:24,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:42:24,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:42:24,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:42:24,848 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand 5 states. [2018-01-31 08:42:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:24,882 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2018-01-31 08:42:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:24,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-31 08:42:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:24,885 INFO L225 Difference]: With dead ends: 229 [2018-01-31 08:42:24,885 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:42:24,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:42:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2018-01-31 08:42:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:42:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-01-31 08:42:24,896 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 24 [2018-01-31 08:42:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:24,896 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-01-31 08:42:24,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:42:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-01-31 08:42:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:42:24,897 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:24,897 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:24,898 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash 791641065, now seen corresponding path program 1 times [2018-01-31 08:42:24,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:24,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:24,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:24,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:24,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:24,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:24,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:24,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:24,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:24,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:24,995 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 6 states. [2018-01-31 08:42:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:25,505 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-31 08:42:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:42:25,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:42:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:25,507 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:42:25,507 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:42:25,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:42:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:42:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-31 08:42:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:42:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-31 08:42:25,516 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 25 [2018-01-31 08:42:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:25,517 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-31 08:42:25,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-31 08:42:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:42:25,517 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:25,517 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:25,518 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash 791641066, now seen corresponding path program 1 times [2018-01-31 08:42:25,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:25,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:25,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:25,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:25,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:25,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:25,884 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:42:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:26,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:26,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:42:26,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:42:26,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:42:26,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:42:26,002 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-01-31 08:42:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:26,714 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-31 08:42:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:42:26,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 08:42:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:26,716 INFO L225 Difference]: With dead ends: 177 [2018-01-31 08:42:26,716 INFO L226 Difference]: Without dead ends: 101 [2018-01-31 08:42:26,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:42:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-31 08:42:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-31 08:42:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:42:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-31 08:42:26,726 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 25 [2018-01-31 08:42:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:26,726 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-31 08:42:26,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:42:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-31 08:42:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:42:26,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:26,731 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:26,731 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1264872000, now seen corresponding path program 1 times [2018-01-31 08:42:26,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:26,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:26,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:26,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:26,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:26,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:27,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:27,174 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:27,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:27,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:27,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:42:27,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:27,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:42:27,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:27,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:27,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:28,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:28,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-31 08:42:28,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:42:28,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:42:28,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:42:28,019 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 20 states. [2018-01-31 08:42:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:28,664 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-31 08:42:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:42:28,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-31 08:42:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:28,707 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:42:28,707 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 08:42:28,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:42:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 08:42:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-01-31 08:42:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:42:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 08:42:28,717 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 31 [2018-01-31 08:42:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:28,718 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 08:42:28,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:42:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 08:42:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:42:28,719 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:28,719 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:28,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1090961430, now seen corresponding path program 2 times [2018-01-31 08:42:28,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:28,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:28,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:28,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:28,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:28,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:29,173 WARN L143 SmtUtils]: Spent 164ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:42:29,355 WARN L143 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 08:42:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:29,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:29,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:29,586 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:29,601 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:29,615 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:29,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:29,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:29,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:42:29,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:29,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:42:29,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:29,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:29,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:30,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:30,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-31 08:42:30,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:42:30,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:42:30,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:42:30,406 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 24 states. [2018-01-31 08:42:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:31,542 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-31 08:42:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:42:31,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-31 08:42:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:31,544 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:42:31,544 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:42:31,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:42:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:42:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-01-31 08:42:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:42:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-31 08:42:31,556 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 37 [2018-01-31 08:42:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:31,556 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-31 08:42:31,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:42:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-31 08:42:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:42:31,557 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:31,557 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:31,558 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1622483604, now seen corresponding path program 3 times [2018-01-31 08:42:31,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:31,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:31,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:31,559 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:31,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:31,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:31,977 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:42:32,190 WARN L143 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 08:42:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:32,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:32,601 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:32,606 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:42:32,619 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:32,622 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:32,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:32,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:32,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:42:32,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:32,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:42:32,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:32,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:32,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:42:33,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:33,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-31 08:42:33,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:42:33,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:42:33,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:42:33,327 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 27 states. [2018-01-31 08:42:33,658 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 45 DAG size of output 41 [2018-01-31 08:42:35,584 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 47 DAG size of output 30 [2018-01-31 08:42:36,309 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 42 DAG size of output 31 [2018-01-31 08:42:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:36,451 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-01-31 08:42:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:42:36,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-31 08:42:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:36,453 INFO L225 Difference]: With dead ends: 194 [2018-01-31 08:42:36,453 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:42:36,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 08:42:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:42:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-01-31 08:42:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:42:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-31 08:42:36,462 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 43 [2018-01-31 08:42:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:36,463 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-31 08:42:36,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:42:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-31 08:42:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:42:36,466 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:36,466 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:36,466 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1060534975, now seen corresponding path program 1 times [2018-01-31 08:42:36,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:36,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:36,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,468 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:36,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:36,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-31 08:42:36,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:36,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:36,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:42:36,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:42:36,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:42:36,653 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 5 states. [2018-01-31 08:42:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:36,691 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-31 08:42:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:36,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-31 08:42:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:36,694 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:42:36,694 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:42:36,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:42:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-31 08:42:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:42:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-31 08:42:36,704 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 68 [2018-01-31 08:42:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:36,705 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-31 08:42:36,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:42:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-31 08:42:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:42:36,706 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:36,707 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:36,707 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash -750707679, now seen corresponding path program 1 times [2018-01-31 08:42:36,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:36,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:36,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:36,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:36,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-31 08:42:36,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:36,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:36,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:36,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:36,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:36,850 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 6 states. [2018-01-31 08:42:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:36,973 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2018-01-31 08:42:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:42:36,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-01-31 08:42:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:36,975 INFO L225 Difference]: With dead ends: 166 [2018-01-31 08:42:36,975 INFO L226 Difference]: Without dead ends: 165 [2018-01-31 08:42:36,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:42:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-31 08:42:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2018-01-31 08:42:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-31 08:42:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-01-31 08:42:36,987 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 69 [2018-01-31 08:42:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:36,988 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-01-31 08:42:36,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-01-31 08:42:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:42:36,993 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:36,993 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:36,993 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash -750707678, now seen corresponding path program 1 times [2018-01-31 08:42:36,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:36,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:36,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:36,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:37,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:37,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:37,585 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:37,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:37,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:37,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:37,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-31 08:42:37,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:42:37,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:42:37,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:42:37,942 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 21 states. [2018-01-31 08:42:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:38,229 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2018-01-31 08:42:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:42:38,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-31 08:42:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:38,230 INFO L225 Difference]: With dead ends: 263 [2018-01-31 08:42:38,230 INFO L226 Difference]: Without dead ends: 156 [2018-01-31 08:42:38,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:42:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-31 08:42:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-01-31 08:42:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 08:42:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2018-01-31 08:42:38,241 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 69 [2018-01-31 08:42:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:38,241 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2018-01-31 08:42:38,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:42:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2018-01-31 08:42:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:42:38,243 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:38,243 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:38,243 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -666214024, now seen corresponding path program 2 times [2018-01-31 08:42:38,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:38,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:38,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:38,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:38,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:38,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:39,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:39,420 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:39,425 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:39,453 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:39,467 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:39,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-31 08:42:39,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:42:39,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-31 08:42:39,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:42:39,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:42:39,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:42:39,580 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand 17 states. [2018-01-31 08:42:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:40,005 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2018-01-31 08:42:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:42:40,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-31 08:42:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:40,045 INFO L225 Difference]: With dead ends: 298 [2018-01-31 08:42:40,045 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:42:40,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:42:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:42:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2018-01-31 08:42:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-31 08:42:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-01-31 08:42:40,057 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 75 [2018-01-31 08:42:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:40,057 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-01-31 08:42:40,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:42:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-01-31 08:42:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:42:40,058 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:40,058 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:40,059 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1720783565, now seen corresponding path program 1 times [2018-01-31 08:42:40,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:40,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:40,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,060 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:40,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:40,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:40,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:40,289 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:40,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:40,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:40,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:40,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 08:42:40,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:42:40,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:42:40,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:42:40,627 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 29 states. [2018-01-31 08:42:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:40,894 INFO L93 Difference]: Finished difference Result 273 states and 298 transitions. [2018-01-31 08:42:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:42:40,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-31 08:42:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:40,898 INFO L225 Difference]: With dead ends: 273 [2018-01-31 08:42:40,898 INFO L226 Difference]: Without dead ends: 167 [2018-01-31 08:42:40,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:42:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-31 08:42:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-01-31 08:42:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-31 08:42:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-01-31 08:42:40,912 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 81 [2018-01-31 08:42:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:40,913 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-01-31 08:42:40,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:42:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-01-31 08:42:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:42:40,914 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:40,914 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:40,914 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1763768541, now seen corresponding path program 2 times [2018-01-31 08:42:40,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:40,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:40,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:40,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:40,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:41,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:41,213 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:41,218 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:41,231 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:41,243 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:41,245 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:41,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:41,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:41,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-31 08:42:41,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:42:41,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:42:41,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:42:41,485 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 33 states. [2018-01-31 08:42:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:42,024 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-01-31 08:42:42,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:42:42,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-31 08:42:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:42,026 INFO L225 Difference]: With dead ends: 279 [2018-01-31 08:42:42,026 INFO L226 Difference]: Without dead ends: 173 [2018-01-31 08:42:42,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:42:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-31 08:42:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2018-01-31 08:42:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-31 08:42:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-01-31 08:42:42,039 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 87 [2018-01-31 08:42:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:42,039 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-01-31 08:42:42,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:42:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-01-31 08:42:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:42:42,040 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:42,041 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:42,041 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -818027783, now seen corresponding path program 3 times [2018-01-31 08:42:42,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:42,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:42,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:42,042 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:42,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:42,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:42,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:42,422 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:42,429 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:42:42,449 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:42,463 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:42,464 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:42,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:42,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:42:42,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:42,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:42,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:42:42,664 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-31 08:42:42,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:42:42,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:42,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:42:42,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-31 08:42:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-31 08:42:42,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:42,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-31 08:42:42,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:42:42,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:42:42,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-31 08:42:42,733 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 28 states. [2018-01-31 08:42:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:43,724 INFO L93 Difference]: Finished difference Result 309 states and 341 transitions. [2018-01-31 08:42:43,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:42:43,725 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-31 08:42:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:43,726 INFO L225 Difference]: With dead ends: 309 [2018-01-31 08:42:43,726 INFO L226 Difference]: Without dead ends: 203 [2018-01-31 08:42:43,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-31 08:42:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-31 08:42:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 174. [2018-01-31 08:42:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-31 08:42:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-01-31 08:42:43,745 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 93 [2018-01-31 08:42:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:43,745 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-01-31 08:42:43,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:42:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-01-31 08:42:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:42:43,747 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:43,747 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:43,747 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -163445168, now seen corresponding path program 1 times [2018-01-31 08:42:43,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:43,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:43,749 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:43,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:43,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:44,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:44,042 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:44,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:44,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:44,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:44,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 08:42:44,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:42:44,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:42:44,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:42:44,386 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 41 states. [2018-01-31 08:42:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:44,889 INFO L93 Difference]: Finished difference Result 287 states and 312 transitions. [2018-01-31 08:42:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:42:44,891 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-31 08:42:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:44,892 INFO L225 Difference]: With dead ends: 287 [2018-01-31 08:42:44,892 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:42:44,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:42:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:42:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-01-31 08:42:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-31 08:42:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-01-31 08:42:44,907 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 99 [2018-01-31 08:42:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:44,908 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-01-31 08:42:44,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:42:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-01-31 08:42:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 08:42:44,909 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:44,909 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:44,909 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:42:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 163041574, now seen corresponding path program 2 times [2018-01-31 08:42:44,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:44,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:44,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:44,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:44,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:44,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 125 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-31 08:42:45,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:45,878 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:45,887 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:45,901 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:45,915 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:45,919 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:45,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:45,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:42:45,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:45,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:42:45,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:45,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:42:45,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:45,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:42:45,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:46,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:46,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:42:48,586 WARN L143 SmtUtils]: Spent 339ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:42:49,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-01-31 08:42:49,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:49,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-01-31 08:42:49,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:49,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-01-31 08:42:49,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:49,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:49,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-31 08:42:49,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:49,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:49,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-31 08:42:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:50,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:50,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 32] total 52 [2018-01-31 08:42:50,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:42:50,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:42:50,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2535, Unknown=5, NotChecked=0, Total=2756 [2018-01-31 08:42:50,172 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 53 states. [2018-01-31 08:42:56,508 WARN L146 SmtUtils]: Spent 6097ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-01-31 08:42:58,731 WARN L146 SmtUtils]: Spent 2143ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-31 08:43:01,017 WARN L146 SmtUtils]: Spent 2130ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-31 08:43:05,249 WARN L146 SmtUtils]: Spent 4068ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-31 08:43:09,479 WARN L146 SmtUtils]: Spent 4084ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-01-31 08:43:11,798 WARN L146 SmtUtils]: Spent 2105ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-31 08:43:15,949 WARN L146 SmtUtils]: Spent 4086ms on a formula simplification. DAG size of input: 78 DAG size of output 65 [2018-01-31 08:43:18,066 WARN L146 SmtUtils]: Spent 2069ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-31 08:43:18,660 WARN L146 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-01-31 08:43:18,834 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-31 08:43:19,249 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-31 08:43:19,479 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 77 DAG size of output 70 [2018-01-31 08:43:21,264 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-31 08:43:21,623 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-31 08:43:22,021 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-31 08:43:22,431 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-31 08:43:23,501 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-31 08:43:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-31 08:43:43,383 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:188) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:67) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:135) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:200) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:398) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.returnSuccessors(TotalizeNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.returnSuccessors(ComplementDeterministicNwa.java:142) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessors(ProductNwa.java:284) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessorsGivenHier(ProductNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addReturnsAndSuccessors(NestedWordAutomatonReachableStates.java:1112) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.propagateNewDownStates(NestedWordAutomatonReachableStates.java:1194) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:985) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 50 more [2018-01-31 08:43:43,387 INFO L168 Benchmark]: Toolchain (without parser) took 81140.97 ms. Allocated memory was 306.2 MB in the beginning and 653.8 MB in the end (delta: 347.6 MB). Free memory was 264.9 MB in the beginning and 361.2 MB in the end (delta: -96.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:43:43,389 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:43:43,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.71 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 251.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:43:43,389 INFO L168 Benchmark]: Boogie Preprocessor took 44.22 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:43:43,389 INFO L168 Benchmark]: RCFGBuilder took 741.73 ms. Allocated memory is still 306.2 MB. Free memory was 249.0 MB in the beginning and 224.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:43:43,390 INFO L168 Benchmark]: TraceAbstraction took 80002.35 ms. Allocated memory was 306.2 MB in the beginning and 653.8 MB in the end (delta: 347.6 MB). Free memory was 224.0 MB in the beginning and 361.2 MB in the end (delta: -137.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 5.3 GB. [2018-01-31 08:43:43,392 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 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 341.71 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 251.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.22 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 741.73 ms. Allocated memory is still 306.2 MB. Free memory was 249.0 MB in the beginning and 224.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 80002.35 ms. Allocated memory was 306.2 MB in the beginning and 653.8 MB in the end (delta: 347.6 MB). Free memory was 224.0 MB in the beginning and 361.2 MB in the end (delta: -137.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-43-43-401.csv Received shutdown request...