java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:36:49,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:36:49,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:36:49,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:36:49,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:36:49,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:36:49,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:36:49,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:36:49,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:36:49,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:36:49,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:36:49,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:36:49,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:36:49,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:36:49,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:36:49,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:36:49,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:36:49,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:36:49,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:36:49,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:36:49,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:36:49,059 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:36:49,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:36:49,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:36:49,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:36:49,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:36:49,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:36:49,062 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:36:49,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:36:49,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:36:49,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:36:49,062 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 04:36:49,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:36:49,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:36:49,072 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:36:49,072 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:36:49,072 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:36:49,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:36:49,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:36:49,074 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:36:49,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:36:49,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:36:49,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:36:49,074 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:36:49,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:49,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:36:49,106 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:36:49,108 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:36:49,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:36:49,109 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:36:49,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 04:36:49,237 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:36:49,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:36:49,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:49,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:36:49,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:36:49,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385f3e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49, skipping insertion in model container [2018-02-04 04:36:49,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,262 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:49,292 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:49,371 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:49,382 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:49,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49 WrapperNode [2018-02-04 04:36:49,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:49,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:36:49,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:36:49,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:36:49,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... [2018-02-04 04:36:49,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:36:49,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:36:49,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:36:49,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:36:49,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:36:49,452 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:36:49,452 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:36:49,452 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 04:36:49,453 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-04 04:36:49,453 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-04 04:36:49,453 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 04:36:49,454 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:36:49,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:36:49,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:36:49,539 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:36:49,630 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:36:49,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:49 BoogieIcfgContainer [2018-02-04 04:36:49,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:36:49,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:36:49,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:36:49,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:36:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:36:49" (1/3) ... [2018-02-04 04:36:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c79892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:49, skipping insertion in model container [2018-02-04 04:36:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:49" (2/3) ... [2018-02-04 04:36:49,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c79892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:49, skipping insertion in model container [2018-02-04 04:36:49,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:49" (3/3) ... [2018-02-04 04:36:49,636 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 04:36:49,641 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:36:49,645 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 04:36:49,667 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:36:49,668 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:36:49,668 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:36:49,668 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:36:49,668 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:36:49,668 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:36:49,668 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:36:49,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:36:49,669 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:36:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-04 04:36:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:49,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:49,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:49,686 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:49,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:49,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:49,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:49,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:49,757 INFO L182 omatonBuilderFactory]: Interpolants [64#false, 65#(= 1 (select |#valid| |~#a.base|)), 63#true] [2018-02-04 04:36:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:49,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:36:49,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:36:49,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:36:49,767 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-04 04:36:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:49,873 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 04:36:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:36:49,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:36:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:49,884 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:36:49,884 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 04:36:49,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:36:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 04:36:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 04:36:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 04:36:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 04:36:49,908 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-04 04:36:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:49,909 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 04:36:49,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:36:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 04:36:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:49,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:49,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:49,909 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:49,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:49,921 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:49,925 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:49,925 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:49,926 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:49,926 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:49,955 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:50,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,018 INFO L182 omatonBuilderFactory]: Interpolants [183#true, 184#false, 185#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 186#(and (= 4 (select |#length| |~#a.base|)) (<= 0 |~#a.offset|) (<= (+ |~#a.offset| 1) (select |#length| |~#a.base|)))] [2018-02-04 04:36:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:50,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:50,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,020 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 4 states. [2018-02-04 04:36:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,066 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-02-04 04:36:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:50,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:36:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,067 INFO L225 Difference]: With dead ends: 56 [2018-02-04 04:36:50,067 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 04:36:50,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 04:36:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 04:36:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 04:36:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-02-04 04:36:50,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 4 [2018-02-04 04:36:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,138 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-02-04 04:36:50,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-02-04 04:36:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-02-04 04:36:50,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,139 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-02-04 04:36:50,139 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash 90875495, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,170 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:50,175 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,175 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,176 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,176 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,182 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:50,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,242 INFO L182 omatonBuilderFactory]: Interpolants [299#true, 300#false, 301#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 302#(and (= 4 (select |#length| |~#a.base|)) (<= (+ |~#a.offset| 2) (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 1)))] [2018-02-04 04:36:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:50,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:50,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,242 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 4 states. [2018-02-04 04:36:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,278 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 04:36:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:50,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-02-04 04:36:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,280 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:36:50,280 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 04:36:50,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 04:36:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 04:36:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:36:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 04:36:50,284 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 5 [2018-02-04 04:36:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,284 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 04:36:50,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 04:36:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-02-04 04:36:50,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,285 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-02-04 04:36:50,285 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1477826961, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,322 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:50,323 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,323 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,323 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,324 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,329 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:50,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,361 INFO L182 omatonBuilderFactory]: Interpolants [416#(and (= 4 (select |#length| |~#a.base|)) (<= (+ |~#a.offset| 3) (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 2))), 413#true, 414#false, 415#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp))] [2018-02-04 04:36:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:50,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:50,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,362 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-02-04 04:36:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,388 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-04 04:36:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:50,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-02-04 04:36:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,388 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:36:50,389 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:36:50,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:36:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 04:36:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 04:36:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-04 04:36:50,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 6 [2018-02-04 04:36:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,392 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-04 04:36:50,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-04 04:36:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 04:36:50,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,392 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:50,392 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1432004458, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,417 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:50,418 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,418 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,419 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,419 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,424 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:50,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,472 INFO L182 omatonBuilderFactory]: Interpolants [528#(and (= 4 (select |#length| |~#a.base|)) (<= 0 (+ |~#a.offset| 3)) (<= (+ |~#a.offset| 4) (select |#length| |~#a.base|))), 525#true, 526#false, 527#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp))] [2018-02-04 04:36:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:50,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:50,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,473 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 4 states. [2018-02-04 04:36:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,502 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 04:36:50,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:50,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-02-04 04:36:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,503 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:36:50,503 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:36:50,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:36:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 04:36:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:36:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 04:36:50,506 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 7 [2018-02-04 04:36:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,506 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 04:36:50,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 04:36:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:36:50,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,506 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:50,506 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,522 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:50,523 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,523 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,524 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,524 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,528 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:36:50,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,569 INFO L182 omatonBuilderFactory]: Interpolants [645#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 646#(= 1 (select |#valid| |foo_~#p~0.base|)), 647#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 635#true, 636#false] [2018-02-04 04:36:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:36:50,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:36:50,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-02-04 04:36:50,570 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 5 states. [2018-02-04 04:36:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,677 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-02-04 04:36:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:36:50,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 04:36:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,682 INFO L225 Difference]: With dead ends: 57 [2018-02-04 04:36:50,682 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 04:36:50,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-02-04 04:36:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 04:36:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-02-04 04:36:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 04:36:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 04:36:50,686 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-04 04:36:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,686 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 04:36:50,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:36:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 04:36:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:36:50,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:50,687 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,706 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:50,708 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,716 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 9 treesize of output 8 [2018-02-04 04:36:50,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:36:50,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:36:50,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:9 [2018-02-04 04:36:50,727 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |c_#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |c_#length| %1 4))) :qid itp)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:50,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:36:50,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,784 INFO L182 omatonBuilderFactory]: Interpolants [768#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |#length| %1 4))) :qid itp)) :qid itp)) :qid itp)), 769#(and (= 4 (select |#length| |foo_~#p~0.base|)) (= 1 (select |#valid| |foo_~#p~0.base|)) (= 0 |foo_~#p~0.offset|)), 770#(and (= 4 (select |#length| |foo_~#p~0.base|)) (<= (+ |foo_~#p~0.offset| 4) (select |#length| |foo_~#p~0.base|)) (<= 0 |foo_~#p~0.offset|)), 771#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 758#true, 759#false] [2018-02-04 04:36:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:50,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:36:50,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:36:50,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 04:36:50,784 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 6 states. [2018-02-04 04:36:50,802 WARN L1011 $PredicateComparison]: unable to prove that (and (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (exists ((%2 (Array Int Int))) (! (and (= (store |c_#valid| %1 1) (store %0 %1 1)) (= (store %2 %1 4) (store |c_#length| %1 4))) :qid itp)) :qid itp)) :qid itp)) (= |c_~#a.base| |c_old(~#a.base)|) (= |c_~#a.offset| |c_old(~#a.offset)|) (= |c_#valid| |c_old(#valid)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#memory_int| |c_old(#memory_int)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 04:36:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:50,871 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 04:36:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:36:50,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 04:36:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:50,872 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:36:50,872 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 04:36:50,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-02-04 04:36:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 04:36:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-04 04:36:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:36:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 04:36:50,876 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-04 04:36:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:50,876 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 04:36:50,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:36:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 04:36:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:36:50,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:50,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:50,877 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:50,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:50,894 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:50,926 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,926 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,927 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:50,927 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:57,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:36:57,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,076 INFO L182 omatonBuilderFactory]: Interpolants [888#(and (<= 4 (select |#length| |~#a.base|)) (= 1 (select |#valid| |~#a.base|)) (= 0 |~#a.offset|)), 889#(and (= |~#a.offset| 0) (= 1 (select |#valid| |~#a.base|)) (forall ((%0 Int)) (or (= |~#a.base| %0) (<= 4 (select (store |#length| %0 4) |~#a.base|))))), 890#(and (<= 4 (select |#length| |~#a.base|)) (= 0 |~#a.offset|)), 891#(and (<= 0 |~#a.offset|) (<= (+ |~#a.offset| 4) (select |#length| |~#a.base|))), 892#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 893#(= 0 |~#a.offset|), 878#true, 894#(and (= 1 (select |#valid| |~#a.base|)) (= 0 |~#a.offset|)), 879#false] [2018-02-04 04:36:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:36:57,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:36:57,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=44, Unknown=3, NotChecked=0, Total=72 [2018-02-04 04:36:57,077 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 9 states. [2018-02-04 04:36:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:57,213 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-02-04 04:36:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:36:57,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-02-04 04:36:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:57,214 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:36:57,214 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:36:57,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=41, Invalid=66, Unknown=3, NotChecked=0, Total=110 [2018-02-04 04:36:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:36:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-02-04 04:36:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 04:36:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-04 04:36:57,216 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-04 04:36:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:57,217 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-04 04:36:57,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:36:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-04 04:36:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:36:57,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:57,218 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, 1, 1] [2018-02-04 04:36:57,218 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:57,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:57,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:36:57,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,360 INFO L182 omatonBuilderFactory]: Interpolants [1024#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1030#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 999#true, 1031#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1000#false, 1032#(<= |#Ultimate.C_memcpy_size| 0), 1023#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:36:57,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:36:57,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:36:57,361 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 7 states. [2018-02-04 04:36:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:57,437 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 04:36:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:36:57,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:36:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:57,438 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:36:57,438 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 04:36:57,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:36:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 04:36:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 04:36:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:36:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 04:36:57,441 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 27 [2018-02-04 04:36:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:57,442 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 04:36:57,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:36:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 04:36:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:36:57,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:57,443 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, 1, 1, 1] [2018-02-04 04:36:57,443 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422323, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:57,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:57,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 04:36:57,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,559 INFO L182 omatonBuilderFactory]: Interpolants [1139#true, 1140#false, 1172#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1173#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1174#(or (and (< 1 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 1))), 1175#(<= |#Ultimate.C_memcpy_size| 1), 1164#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1165#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:36:57,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:36:57,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:36:57,560 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-02-04 04:36:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:57,633 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 04:36:57,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:36:57,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 04:36:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:57,634 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:36:57,634 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 04:36:57,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:36:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 04:36:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 04:36:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 04:36:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 04:36:57,637 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 28 [2018-02-04 04:36:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:57,637 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 04:36:57,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:36:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 04:36:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:36:57,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:57,638 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 04:36:57,638 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash -944250100, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:57,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:57,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 04:36:57,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,730 INFO L182 omatonBuilderFactory]: Interpolants [1312#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1313#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1286#true, 1287#false, 1321#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1322#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1323#(= 1 |#Ultimate.C_memcpy_#t~loopctr5|), 1324#(or (and (< 2 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 2))), 1325#(<= |#Ultimate.C_memcpy_size| 2)] [2018-02-04 04:36:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:36:57,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:36:57,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:36:57,731 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 9 states. [2018-02-04 04:36:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:57,810 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-02-04 04:36:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:36:57,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 04:36:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:57,810 INFO L225 Difference]: With dead ends: 57 [2018-02-04 04:36:57,810 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:36:57,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:36:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:36:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 04:36:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:36:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 04:36:57,812 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 29 [2018-02-04 04:36:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:57,813 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 04:36:57,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:36:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 04:36:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 04:36:57,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:57,813 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:57,813 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -169780371, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 04:36:57,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:57,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:36:57,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,910 INFO L182 omatonBuilderFactory]: Interpolants [1440#true, 1441#false, 1477#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1478#(= 0 |#Ultimate.C_memcpy_#t~loopctr5|), 1479#(= 1 |#Ultimate.C_memcpy_#t~loopctr5|), 1480#(= 2 |#Ultimate.C_memcpy_#t~loopctr5|), 1481#(or (and (< 3 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr5| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr5|) (<= |#Ultimate.C_memcpy_size| 3))), 1482#(<= |#Ultimate.C_memcpy_size| 3), 1467#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1468#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:57,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:36:57,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:36:57,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:36:57,911 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 10 states. [2018-02-04 04:36:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:58,013 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-04 04:36:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:36:58,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-04 04:36:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:58,014 INFO L225 Difference]: With dead ends: 59 [2018-02-04 04:36:58,014 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 04:36:58,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 04:36:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 04:36:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:36:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 04:36:58,016 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 30 [2018-02-04 04:36:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:58,016 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 04:36:58,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:36:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 04:36:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:36:58,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:58,016 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 04:36:58,017 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022548, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:58,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:58,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:36:58,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:58,089 INFO L182 omatonBuilderFactory]: Interpolants [1601#true, 1602#false, 1641#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1629#(= 1 (select |#valid| |main_~#p~1.base|)), 1630#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1631#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:36:58,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:36:58,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:36:58,090 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 6 states. [2018-02-04 04:36:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:58,124 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 04:36:58,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:36:58,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 04:36:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:58,124 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:36:58,124 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:36:58,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:36:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:36:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 04:36:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:36:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 04:36:58,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 31 [2018-02-04 04:36:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:58,128 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 04:36:58,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:36:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 04:36:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:36:58,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:58,129 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 04:36:58,129 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022547, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:58,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:58,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:36:58,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:58,285 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1793#(= 1 (select |#valid| |#Ultimate.C_memcpy_dest.base|)), 1778#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1794#(or (= (select |#valid| |#Ultimate.C_memcpy_dest.base|) 1) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|)), 1779#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1748#true, 1780#(= 0 (select |old(#valid)| |foo_~#p~0.base|)), 1749#false, 1758#(= 1 (select |#valid| |~#a.base|)), 1790#(or (= (select |old(#valid)| |~#a.base|) 0) (= (select (store |#valid| |foo_~#p~0.base| 0) |~#a.base|) 1)), 1759#(not (= 0 (select |#valid| |~#a.base|))), 1791#(or (= (select |#valid| |~#a.base|) 1) (= (select |old(#valid)| |~#a.base|) 0))] [2018-02-04 04:36:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:36:58,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:36:58,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:58,285 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2018-02-04 04:36:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:58,418 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 04:36:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:36:58,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 04:36:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:58,419 INFO L225 Difference]: With dead ends: 52 [2018-02-04 04:36:58,419 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 04:36:58,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:36:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 04:36:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 04:36:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:36:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-02-04 04:36:58,421 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 31 [2018-02-04 04:36:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:58,421 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-02-04 04:36:58,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:36:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-02-04 04:36:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:36:58,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:58,421 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 04:36:58,421 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1931022546, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:58,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:58,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:36:58,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:58,497 INFO L182 omatonBuilderFactory]: Interpolants [1953#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1941#(and (= 4 (select |#length| |main_~#p~1.base|)) (<= 0 |main_~#p~1.offset|) (<= (+ |main_~#p~1.offset| 4) (select |#length| |main_~#p~1.base|))), 1942#(and (= |~#a.base| |old(~#a.base)|) (= |~#a.offset| |old(~#a.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1943#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1913#true, 1914#false] [2018-02-04 04:36:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:36:58,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:36:58,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:36:58,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:36:58,497 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 6 states. [2018-02-04 04:36:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:58,527 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 04:36:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:36:58,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 04:36:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:58,528 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:36:58,528 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:36:58,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:36:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:36:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 04:36:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:36:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 04:36:58,530 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 31 [2018-02-04 04:36:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:58,530 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 04:36:58,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:36:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 04:36:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:36:58,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:58,531 INFO L351 BasicCegarLoop]: trace histogram [8, 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] [2018-02-04 04:36:58,531 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 04:36:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:58,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,559 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,606 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:58,688 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:58,735 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,762 WARN L1011 $PredicateComparison]: unable to prove that (forall ((%0 Int)) (! (exists ((%2 Int) (%1 (Array Int Int)) (%3 (Array Int (Array Int Int)))) (! (forall ((%4 Int)) (! (or (not (= |c_#Ultimate.C_memcpy_src.offset| 0)) (not (= |c_#Ultimate.C_memcpy_dest.offset| 0)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_src.base|) 1))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_dest.base|) 1)) (= (select (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %0) %1) (= %1 (select |c_#memory_$Pointer$.offset| %0)) (let ((.cse1 (store %1 1 %2))) (= (store |c_#memory_$Pointer$.offset| %4 .cse1) (store %3 %4 .cse1))) (= .cse0 %2)))) :qid itp)) :qid itp)) :qid itp)) is different from false [2018-02-04 04:36:58,764 WARN L1033 $PredicateComparison]: unable to prove that (forall ((%0 Int)) (! (exists ((%2 Int) (%1 (Array Int Int)) (%3 (Array Int (Array Int Int)))) (! (forall ((%4 Int)) (! (or (not (= |c_#Ultimate.C_memcpy_src.offset| 0)) (not (= |c_#Ultimate.C_memcpy_dest.offset| 0)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_src.base|) 1))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |c_#Ultimate.C_memcpy_dest.base|) 1)) (= (select (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %0) %1) (= %1 (select |c_#memory_$Pointer$.offset| %0)) (let ((.cse1 (store %1 1 %2))) (= (store |c_#memory_$Pointer$.offset| %4 .cse1) (store %3 %4 .cse1))) (= .cse0 %2)))) :qid itp)) :qid itp)) :qid itp)) is different from true [2018-02-04 04:36:58,764 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,764 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,764 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,764 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:58,765 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:01,031 WARN L146 SmtUtils]: Spent 2183ms on a formula simplification. DAG size of input: 594 DAG size of output 153 [2018-02-04 04:37:01,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 166 treesize of output 165 [2018-02-04 04:37:01,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:01,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 193 treesize of output 192 [2018-02-04 04:37:01,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:01,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 55 [2018-02-04 04:37:01,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:02,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 149 treesize of output 148 [2018-02-04 04:37:02,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:02,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 139 treesize of output 138 [2018-02-04 04:37:02,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:02,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 166 treesize of output 165 [2018-02-04 04:37:02,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:02,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 166 treesize of output 165 [2018-02-04 04:37:02,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:03,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 152 treesize of output 151 [2018-02-04 04:37:03,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:03,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 125 treesize of output 124 [2018-02-04 04:37:03,531 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:03,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 98 treesize of output 97 [2018-02-04 04:37:03,752 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:03,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 122 treesize of output 121 [2018-02-04 04:37:03,914 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 95 treesize of output 94 [2018-02-04 04:37:04,093 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 139 treesize of output 138 [2018-02-04 04:37:04,247 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 112 treesize of output 111 [2018-02-04 04:37:04,380 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 139 treesize of output 138 [2018-02-04 04:37:04,491 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 112 treesize of output 111 [2018-02-04 04:37:04,576 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 112 treesize of output 111 [2018-02-04 04:37:04,578 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:04,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 14 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-02-04 04:37:04,657 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 93 variables, input treesize:4587, output treesize:435 [2018-02-04 04:37:04,658 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 04:37:04,896 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 769 Received shutdown request... [2018-02-04 04:40:26,156 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:40:26,160 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:40:26,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:40:26 BoogieIcfgContainer [2018-02-04 04:40:26,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:40:26,161 INFO L168 Benchmark]: Toolchain (without parser) took 216923.66 ms. Allocated memory was 393.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 350.2 MB in the beginning and 114.2 MB in the end (delta: 236.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. [2018-02-04 04:40:26,162 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 393.7 MB. Free memory is still 355.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:40:26,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.54 ms. Allocated memory is still 393.7 MB. Free memory was 350.2 MB in the beginning and 339.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:40:26,162 INFO L168 Benchmark]: Boogie Preprocessor took 25.45 ms. Allocated memory is still 393.7 MB. Free memory was 339.7 MB in the beginning and 337.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:40:26,163 INFO L168 Benchmark]: RCFGBuilder took 214.59 ms. Allocated memory is still 393.7 MB. Free memory was 337.0 MB in the beginning and 314.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:40:26,163 INFO L168 Benchmark]: TraceAbstraction took 216529.16 ms. Allocated memory was 393.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 314.4 MB in the beginning and 114.2 MB in the end (delta: 200.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. [2018-02-04 04:40:26,165 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.09 ms. Allocated memory is still 393.7 MB. Free memory is still 355.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.54 ms. Allocated memory is still 393.7 MB. Free memory was 350.2 MB in the beginning and 339.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.45 ms. Allocated memory is still 393.7 MB. Free memory was 339.7 MB in the beginning and 337.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 214.59 ms. Allocated memory is still 393.7 MB. Free memory was 337.0 MB in the beginning and 314.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 216529.16 ms. Allocated memory was 393.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 314.4 MB in the beginning and 114.2 MB in the end (delta: 200.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was transforming 769 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 216.4s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 529 SDtfs, 220 SDslu, 911 SDs, 0 SdLazy, 958 SolverSat, 143 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 30/40 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 261 ConstructedInterpolants, 11 QuantifiedInterpolants, 28089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 30/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-40-26-172.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-40-26-172.csv Completed graceful shutdown